/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-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:25:17,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:25:17,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:25:17,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:25:17,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:25:17,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:25:17,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:25:17,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:25:17,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:25:17,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:25:17,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:25:17,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:25:17,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:25:17,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:25:17,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:25:17,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:25:17,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:25:17,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:25:17,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:25:17,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:25:17,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:25:17,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:25:17,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:25:17,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:25:17,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:25:17,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:25:17,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:25:17,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:25:17,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:25:17,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:25:17,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:25:17,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:25:17,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:25:17,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:25:17,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:25:17,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:25:17,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:25:17,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:25:17,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:25:17,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:25:17,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:25:17,179 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:17,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:25:17,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:25:17,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:25:17,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:25:17,207 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:25:17,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:25:17,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:25:17,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:25:17,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:25:17,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:25:17,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:25:17,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:25:17,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:25:17,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:25:17,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:25:17,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:25:17,211 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:17,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:25:17,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:25:17,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:25:17,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:25:17,505 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:25:17,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-06 07:25:18,583 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:25:18,767 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:25:18,767 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-06 07:25:18,773 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c42a8b74/1bc16c934cb34f7b979a6de6e1ee5b74/FLAG776b80df4 [2022-12-06 07:25:18,787 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c42a8b74/1bc16c934cb34f7b979a6de6e1ee5b74 [2022-12-06 07:25:18,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:25:18,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:25:18,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:25:18,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:25:18,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:25:18,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:25:18" (1/1) ... [2022-12-06 07:25:18,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b06a711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:18, skipping insertion in model container [2022-12-06 07:25:18,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:25:18" (1/1) ... [2022-12-06 07:25:18,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:25:18,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:25:18,912 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-dist.wvr.c[2116,2129] [2022-12-06 07:25:18,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:25:18,921 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:25:18,937 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-dist.wvr.c[2116,2129] [2022-12-06 07:25:18,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:25:18,947 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:25:18,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:18 WrapperNode [2022-12-06 07:25:18,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:25:18,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:25:18,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:25:18,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:25:18,953 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:18" (1/1) ... [2022-12-06 07:25:18,967 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:18" (1/1) ... [2022-12-06 07:25:18,985 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-12-06 07:25:18,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:25:18,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:25:18,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:25:18,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:25:18,992 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:18" (1/1) ... [2022-12-06 07:25:18,992 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:18" (1/1) ... [2022-12-06 07:25:18,996 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:18" (1/1) ... [2022-12-06 07:25:18,996 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:18" (1/1) ... [2022-12-06 07:25:19,020 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:18" (1/1) ... [2022-12-06 07:25:19,022 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:18" (1/1) ... [2022-12-06 07:25:19,023 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:18" (1/1) ... [2022-12-06 07:25:19,024 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:18" (1/1) ... [2022-12-06 07:25:19,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:25:19,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:25:19,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:25:19,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:25:19,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:18" (1/1) ... [2022-12-06 07:25:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:25:19,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:19,064 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:19,071 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:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:25:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:25:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:25:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:25:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:25:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:25:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:25:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:25:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:25:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:25:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:25:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:25:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:25:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:25:19,100 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:19,164 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:25:19,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:25:19,403 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:25:19,408 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:25:19,408 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:25:19,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:25:19 BoogieIcfgContainer [2022-12-06 07:25:19,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:25:19,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:25:19,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:25:19,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:25:19,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:25:18" (1/3) ... [2022-12-06 07:25:19,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdecce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:25:19, skipping insertion in model container [2022-12-06 07:25:19,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:25:18" (2/3) ... [2022-12-06 07:25:19,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdecce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:25:19, skipping insertion in model container [2022-12-06 07:25:19,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:25:19" (3/3) ... [2022-12-06 07:25:19,417 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2022-12-06 07:25:19,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:25:19,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:25:19,431 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:25:19,513 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:25:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 07:25:19,577 INFO L130 PetriNetUnfolder]: 7/99 cut-off events. [2022-12-06 07:25:19,578 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:25:19,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 99 events. 7/99 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 07:25:19,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 07:25:19,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 89 transitions, 196 flow [2022-12-06 07:25:19,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:19,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-06 07:25:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 196 flow [2022-12-06 07:25:19,622 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-06 07:25:19,622 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:25:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 7/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 07:25:19,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-06 07:25:19,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 07:25:22,034 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-06 07:25:22,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:25:22,049 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;@79183991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:25:22,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:25:22,054 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 07:25:22,054 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:25:22,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:22,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:22,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1839579012, now seen corresponding path program 1 times [2022-12-06 07:25:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:22,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897742866] [2022-12-06 07:25:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:22,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897742866] [2022-12-06 07:25:22,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897742866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:22,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:22,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:25:22,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926241627] [2022-12-06 07:25:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:22,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:25:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:25:22,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:25:22,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 07:25:22,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:22,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:22,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 07:25:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:22,727 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2022-12-06 07:25:22,727 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 07:25:22,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 506 events. 359/506 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1613 event pairs, 39 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 07:25:22,731 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2022-12-06 07:25:22,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2022-12-06 07:25:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:25:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:25:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 07:25:22,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-12-06 07:25:22,750 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 45 transitions. [2022-12-06 07:25:22,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 179 flow [2022-12-06 07:25:22,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:25:22,754 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 76 flow [2022-12-06 07:25:22,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-06 07:25:22,758 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-06 07:25:22,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:22,759 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 76 flow [2022-12-06 07:25:22,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:22,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:22,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 76 flow [2022-12-06 07:25:22,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 76 flow [2022-12-06 07:25:22,766 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] thread3EXIT-->L77-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem15#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][23], [25#L77-2true, 108#true, Black: 110#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0))]) [2022-12-06 07:25:22,767 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:25:22,767 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 07:25:22,767 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:25:22,767 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 07:25:22,768 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 07:25:22,768 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:25:22,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 62 events. 22/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 1 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2022-12-06 07:25:22,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 76 flow [2022-12-06 07:25:22,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 07:25:22,769 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:22,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 07:25:22,771 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 76 flow [2022-12-06 07:25:22,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:22,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:22,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:22,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:25:22,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1296714879, now seen corresponding path program 1 times [2022-12-06 07:25:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:22,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084956401] [2022-12-06 07:25:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:23,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084956401] [2022-12-06 07:25:23,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084956401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:23,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:23,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:25:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314764945] [2022-12-06 07:25:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:23,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:25:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:25:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:25:23,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:25:23,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:23,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:25:23,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:23,223 INFO L130 PetriNetUnfolder]: 638/974 cut-off events. [2022-12-06 07:25:23,223 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 07:25:23,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 974 events. 638/974 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3825 event pairs, 158 based on Foata normal form. 18/992 useless extension candidates. Maximal degree in co-relation 657. Up to 394 conditions per place. [2022-12-06 07:25:23,229 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 71 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2022-12-06 07:25:23,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 89 transitions, 434 flow [2022-12-06 07:25:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 07:25:23,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2022-12-06 07:25:23,231 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 76 flow. Second operand 7 states and 82 transitions. [2022-12-06 07:25:23,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 89 transitions, 434 flow [2022-12-06 07:25:23,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 89 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:23,233 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 139 flow [2022-12-06 07:25:23,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 07:25:23,234 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 07:25:23,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:23,234 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 139 flow [2022-12-06 07:25:23,235 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:23,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:23,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 139 flow [2022-12-06 07:25:23,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 139 flow [2022-12-06 07:25:23,241 INFO L130 PetriNetUnfolder]: 27/91 cut-off events. [2022-12-06 07:25:23,242 INFO L131 PetriNetUnfolder]: For 25/51 co-relation queries the response was YES. [2022-12-06 07:25:23,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 91 events. 27/91 cut-off events. For 25/51 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 312 event pairs, 1 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 158. Up to 34 conditions per place. [2022-12-06 07:25:23,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 139 flow [2022-12-06 07:25:23,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 07:25:23,360 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:23,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 07:25:23,361 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 117 flow [2022-12-06 07:25:23,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:23,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:23,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:25:23,362 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash -941425541, now seen corresponding path program 1 times [2022-12-06 07:25:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:23,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075593862] [2022-12-06 07:25:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:23,481 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:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:23,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075593862] [2022-12-06 07:25:23,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075593862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:23,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060919051] [2022-12-06 07:25:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:23,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:23,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:23,501 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:23,551 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:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:23,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:25:23,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:23,707 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:23,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:23,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060919051] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:23,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:25:23,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 7 [2022-12-06 07:25:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717732169] [2022-12-06 07:25:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:23,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:25:23,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:25:23,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:23,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:25:23,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:24,008 INFO L130 PetriNetUnfolder]: 665/1029 cut-off events. [2022-12-06 07:25:24,008 INFO L131 PetriNetUnfolder]: For 1397/1405 co-relation queries the response was YES. [2022-12-06 07:25:24,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 1029 events. 665/1029 cut-off events. For 1397/1405 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4283 event pairs, 149 based on Foata normal form. 7/1023 useless extension candidates. Maximal degree in co-relation 2705. Up to 330 conditions per place. [2022-12-06 07:25:24,014 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 87 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2022-12-06 07:25:24,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 100 transitions, 583 flow [2022-12-06 07:25:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-06 07:25:24,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 07:25:24,017 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 117 flow. Second operand 7 states and 105 transitions. [2022-12-06 07:25:24,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 100 transitions, 583 flow [2022-12-06 07:25:24,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 100 transitions, 512 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:24,023 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 200 flow [2022-12-06 07:25:24,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-06 07:25:24,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 07:25:24,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:24,025 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 200 flow [2022-12-06 07:25:24,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:24,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:24,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 200 flow [2022-12-06 07:25:24,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 200 flow [2022-12-06 07:25:24,033 INFO L130 PetriNetUnfolder]: 30/111 cut-off events. [2022-12-06 07:25:24,034 INFO L131 PetriNetUnfolder]: For 78/89 co-relation queries the response was YES. [2022-12-06 07:25:24,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 111 events. 30/111 cut-off events. For 78/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 435 event pairs, 0 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 205. Up to 44 conditions per place. [2022-12-06 07:25:24,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 200 flow [2022-12-06 07:25:24,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 07:25:24,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [348] $Ultimate##0-->L41-5: Formula: (and (= v_~x_1~0_47 (+ v_~c~0_62 v_~x_1~0_48)) (= v_thread1Thread1of1ForFork1_~i~0_31 1) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_31 4294967295) 4294967296) (mod v_~a~0_55 4294967296))) InVars {~a~0=v_~a~0_55, ~c~0=v_~c~0_62, ~x_1~0=v_~x_1~0_48} OutVars{~a~0=v_~a~0_55, ~c~0=v_~c~0_62, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~x_1~0=v_~x_1~0_47} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:24,122 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:24,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 07:25:24,123 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 192 flow [2022-12-06 07:25:24,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,124 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,131 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:24,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:24,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1870699834, now seen corresponding path program 1 times [2022-12-06 07:25:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333798743] [2022-12-06 07:25:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333798743] [2022-12-06 07:25:24,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333798743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:24,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:24,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:24,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573140306] [2022-12-06 07:25:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:24,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:24,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:24,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 07:25:24,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:24,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 07:25:24,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:24,658 INFO L130 PetriNetUnfolder]: 719/1153 cut-off events. [2022-12-06 07:25:24,658 INFO L131 PetriNetUnfolder]: For 2152/2152 co-relation queries the response was YES. [2022-12-06 07:25:24,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 1153 events. 719/1153 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5177 event pairs, 123 based on Foata normal form. 28/1164 useless extension candidates. Maximal degree in co-relation 2464. Up to 369 conditions per place. [2022-12-06 07:25:24,665 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 86 selfloop transitions, 13 changer transitions 4/104 dead transitions. [2022-12-06 07:25:24,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 104 transitions, 671 flow [2022-12-06 07:25:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 07:25:24,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2022-12-06 07:25:24,666 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 192 flow. Second operand 7 states and 106 transitions. [2022-12-06 07:25:24,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 104 transitions, 671 flow [2022-12-06 07:25:24,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 104 transitions, 643 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:24,674 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 313 flow [2022-12-06 07:25:24,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-06 07:25:24,675 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 07:25:24,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:24,675 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 313 flow [2022-12-06 07:25:24,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:24,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:24,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-06 07:25:24,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 313 flow [2022-12-06 07:25:24,687 INFO L130 PetriNetUnfolder]: 37/160 cut-off events. [2022-12-06 07:25:24,687 INFO L131 PetriNetUnfolder]: For 265/271 co-relation queries the response was YES. [2022-12-06 07:25:24,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 160 events. 37/160 cut-off events. For 265/271 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 800 event pairs, 0 based on Foata normal form. 3/152 useless extension candidates. Maximal degree in co-relation 319. Up to 56 conditions per place. [2022-12-06 07:25:24,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-06 07:25:24,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 07:25:24,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:25:24,759 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:24,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 07:25:24,760 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 325 flow [2022-12-06 07:25:24,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:25:24,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,761 INFO L85 PathProgramCache]: Analyzing trace with hash -678848004, now seen corresponding path program 2 times [2022-12-06 07:25:24,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407700824] [2022-12-06 07:25:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,861 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:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407700824] [2022-12-06 07:25:24,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407700824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:24,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859505245] [2022-12-06 07:25:24,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:25:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:24,863 INFO L229 MonitoredProcess]: Starting monitored process 3 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:24,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:25:24,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:25:24,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:25:24,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:25:24,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:24,988 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:24,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:25,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859505245] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:25,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:25:25,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 07:25:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530025357] [2022-12-06 07:25:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:25,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:25,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 07:25:25,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:25,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 07:25:25,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:25,195 INFO L130 PetriNetUnfolder]: 766/1222 cut-off events. [2022-12-06 07:25:25,196 INFO L131 PetriNetUnfolder]: For 4013/4119 co-relation queries the response was YES. [2022-12-06 07:25:25,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 1222 events. 766/1222 cut-off events. For 4013/4119 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5642 event pairs, 140 based on Foata normal form. 34/1224 useless extension candidates. Maximal degree in co-relation 2975. Up to 712 conditions per place. [2022-12-06 07:25:25,204 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 56 selfloop transitions, 11 changer transitions 2/73 dead transitions. [2022-12-06 07:25:25,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 561 flow [2022-12-06 07:25:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:25,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 07:25:25,206 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 325 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:25,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 561 flow [2022-12-06 07:25:25,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 547 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 07:25:25,217 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 356 flow [2022-12-06 07:25:25,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-06 07:25:25,219 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 07:25:25,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:25,219 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 356 flow [2022-12-06 07:25:25,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:25,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:25,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 356 flow [2022-12-06 07:25:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 356 flow [2022-12-06 07:25:25,231 INFO L130 PetriNetUnfolder]: 42/161 cut-off events. [2022-12-06 07:25:25,231 INFO L131 PetriNetUnfolder]: For 460/476 co-relation queries the response was YES. [2022-12-06 07:25:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 161 events. 42/161 cut-off events. For 460/476 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 766 event pairs, 0 based on Foata normal form. 5/153 useless extension candidates. Maximal degree in co-relation 377. Up to 65 conditions per place. [2022-12-06 07:25:25,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 356 flow [2022-12-06 07:25:25,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 07:25:25,234 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:25,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 07:25:25,234 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 356 flow [2022-12-06 07:25:25,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:25,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:25,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:25,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:25,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 670880502, now seen corresponding path program 1 times [2022-12-06 07:25:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:25,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293486539] [2022-12-06 07:25:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:25,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:25:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293486539] [2022-12-06 07:25:25,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293486539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:25,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:25,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585555706] [2022-12-06 07:25:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:25,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:25,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:25,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 07:25:25,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 356 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:25,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 07:25:25,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:25,781 INFO L130 PetriNetUnfolder]: 841/1382 cut-off events. [2022-12-06 07:25:25,781 INFO L131 PetriNetUnfolder]: For 5643/5721 co-relation queries the response was YES. [2022-12-06 07:25:25,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 1382 events. 841/1382 cut-off events. For 5643/5721 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6563 event pairs, 236 based on Foata normal form. 47/1413 useless extension candidates. Maximal degree in co-relation 3223. Up to 741 conditions per place. [2022-12-06 07:25:25,788 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 78 selfloop transitions, 13 changer transitions 7/101 dead transitions. [2022-12-06 07:25:25,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 794 flow [2022-12-06 07:25:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 07:25:25,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-06 07:25:25,789 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 356 flow. Second operand 6 states and 90 transitions. [2022-12-06 07:25:25,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 794 flow [2022-12-06 07:25:25,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 749 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:25,796 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 374 flow [2022-12-06 07:25:25,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-06 07:25:25,797 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2022-12-06 07:25:25,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:25,797 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 374 flow [2022-12-06 07:25:25,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:25,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:25,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 374 flow [2022-12-06 07:25:25,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 374 flow [2022-12-06 07:25:25,809 INFO L130 PetriNetUnfolder]: 43/193 cut-off events. [2022-12-06 07:25:25,810 INFO L131 PetriNetUnfolder]: For 495/511 co-relation queries the response was YES. [2022-12-06 07:25:25,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 193 events. 43/193 cut-off events. For 495/511 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1050 event pairs, 0 based on Foata normal form. 6/186 useless extension candidates. Maximal degree in co-relation 428. Up to 71 conditions per place. [2022-12-06 07:25:25,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 374 flow [2022-12-06 07:25:25,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 07:25:25,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:25,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 07:25:25,905 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 378 flow [2022-12-06 07:25:25,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:25,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:25,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:25:25,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash -721536866, now seen corresponding path program 2 times [2022-12-06 07:25:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:25,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249978685] [2022-12-06 07:25:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,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:25:26,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249978685] [2022-12-06 07:25:26,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249978685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702633597] [2022-12-06 07:25:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:26,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 07:25:26,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 07:25:26,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:26,278 INFO L130 PetriNetUnfolder]: 757/1225 cut-off events. [2022-12-06 07:25:26,279 INFO L131 PetriNetUnfolder]: For 5342/5381 co-relation queries the response was YES. [2022-12-06 07:25:26,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 1225 events. 757/1225 cut-off events. For 5342/5381 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5588 event pairs, 212 based on Foata normal form. 30/1241 useless extension candidates. Maximal degree in co-relation 3358. Up to 651 conditions per place. [2022-12-06 07:25:26,286 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 83 selfloop transitions, 10 changer transitions 3/99 dead transitions. [2022-12-06 07:25:26,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 800 flow [2022-12-06 07:25:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 07:25:26,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-06 07:25:26,288 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 378 flow. Second operand 6 states and 90 transitions. [2022-12-06 07:25:26,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 800 flow [2022-12-06 07:25:26,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 775 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:26,294 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 417 flow [2022-12-06 07:25:26,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-06 07:25:26,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 07:25:26,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:26,295 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 417 flow [2022-12-06 07:25:26,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:26,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:26,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 417 flow [2022-12-06 07:25:26,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 417 flow [2022-12-06 07:25:26,308 INFO L130 PetriNetUnfolder]: 37/167 cut-off events. [2022-12-06 07:25:26,308 INFO L131 PetriNetUnfolder]: For 489/506 co-relation queries the response was YES. [2022-12-06 07:25:26,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 167 events. 37/167 cut-off events. For 489/506 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 831 event pairs, 0 based on Foata normal form. 7/166 useless extension candidates. Maximal degree in co-relation 400. Up to 61 conditions per place. [2022-12-06 07:25:26,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 49 transitions, 417 flow [2022-12-06 07:25:26,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 07:25:26,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:25:26,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:25:26,438 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [241] $Ultimate##0-->L49-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:25:26,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [241] $Ultimate##0-->L49-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 07:25:26,561 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:26,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:25:26,562 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 453 flow [2022-12-06 07:25:26,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (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,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:26,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:26,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:25:26,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:26,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1878822181, now seen corresponding path program 1 times [2022-12-06 07:25:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:26,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919050936] [2022-12-06 07:25:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:26,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:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919050936] [2022-12-06 07:25:26,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919050936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:26,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:26,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:25:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801015077] [2022-12-06 07:25:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:26,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:26,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:25:26,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:26,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:26,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:25:26,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,109 INFO L130 PetriNetUnfolder]: 1088/1733 cut-off events. [2022-12-06 07:25:27,109 INFO L131 PetriNetUnfolder]: For 6471/6471 co-relation queries the response was YES. [2022-12-06 07:25:27,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 1733 events. 1088/1733 cut-off events. For 6471/6471 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8121 event pairs, 444 based on Foata normal form. 6/1739 useless extension candidates. Maximal degree in co-relation 6306. Up to 1252 conditions per place. [2022-12-06 07:25:27,148 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 90 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2022-12-06 07:25:27,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 860 flow [2022-12-06 07:25:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 07:25:27,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-06 07:25:27,150 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 453 flow. Second operand 6 states and 82 transitions. [2022-12-06 07:25:27,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 860 flow [2022-12-06 07:25:27,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 824 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:27,157 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 465 flow [2022-12-06 07:25:27,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2022-12-06 07:25:27,158 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2022-12-06 07:25:27,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,158 INFO L89 Accepts]: Start accepts. Operand has 70 places, 54 transitions, 465 flow [2022-12-06 07:25:27,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 54 transitions, 465 flow [2022-12-06 07:25:27,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 465 flow [2022-12-06 07:25:27,173 INFO L130 PetriNetUnfolder]: 55/242 cut-off events. [2022-12-06 07:25:27,173 INFO L131 PetriNetUnfolder]: For 631/671 co-relation queries the response was YES. [2022-12-06 07:25:27,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 242 events. 55/242 cut-off events. For 631/671 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1453 event pairs, 2 based on Foata normal form. 8/232 useless extension candidates. Maximal degree in co-relation 694. Up to 93 conditions per place. [2022-12-06 07:25:27,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 54 transitions, 465 flow [2022-12-06 07:25:27,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 07:25:27,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [350] $Ultimate##0-->L41-5: Formula: (and (= v_~x_1~0_51 (+ v_~c~0_64 v_~x_1~0_52)) (= v_thread3Thread1of1ForFork0_~i~2_30 0) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_36 4294967295) 4294967296) (mod v_~a~0_57 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_36 1)) InVars {~a~0=v_~a~0_57, ~c~0=v_~c~0_64, ~x_1~0=v_~x_1~0_52} OutVars{~a~0=v_~a~0_57, ~c~0=v_~c~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~x_1~0=v_~x_1~0_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:27,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:27,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 07:25:27,231 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 465 flow [2022-12-06 07:25:27,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:27,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:27,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:27,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:25:27,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1808995553, now seen corresponding path program 1 times [2022-12-06 07:25:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:27,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932535027] [2022-12-06 07:25:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:27,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:27,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:25:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932535027] [2022-12-06 07:25:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932535027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:27,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:27,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:27,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070994204] [2022-12-06 07:25:27,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:27,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:27,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:27,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:27,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:27,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:25:27,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:27,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:27,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:25:27,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,508 INFO L130 PetriNetUnfolder]: 1098/1751 cut-off events. [2022-12-06 07:25:27,508 INFO L131 PetriNetUnfolder]: For 7828/7828 co-relation queries the response was YES. [2022-12-06 07:25:27,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7827 conditions, 1751 events. 1098/1751 cut-off events. For 7828/7828 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8186 event pairs, 570 based on Foata normal form. 8/1759 useless extension candidates. Maximal degree in co-relation 7471. Up to 1478 conditions per place. [2022-12-06 07:25:27,519 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 59 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2022-12-06 07:25:27,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 687 flow [2022-12-06 07:25:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 07:25:27,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:25:27,520 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 465 flow. Second operand 4 states and 56 transitions. [2022-12-06 07:25:27,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 687 flow [2022-12-06 07:25:27,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 669 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:27,531 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 503 flow [2022-12-06 07:25:27,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2022-12-06 07:25:27,531 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 07:25:27,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,531 INFO L89 Accepts]: Start accepts. Operand has 73 places, 55 transitions, 503 flow [2022-12-06 07:25:27,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 55 transitions, 503 flow [2022-12-06 07:25:27,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 55 transitions, 503 flow [2022-12-06 07:25:27,546 INFO L130 PetriNetUnfolder]: 55/244 cut-off events. [2022-12-06 07:25:27,546 INFO L131 PetriNetUnfolder]: For 795/868 co-relation queries the response was YES. [2022-12-06 07:25:27,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 244 events. 55/244 cut-off events. For 795/868 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1466 event pairs, 2 based on Foata normal form. 8/232 useless extension candidates. Maximal degree in co-relation 700. Up to 94 conditions per place. [2022-12-06 07:25:27,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 55 transitions, 503 flow [2022-12-06 07:25:27,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 07:25:27,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] $Ultimate##0-->L57-5: Formula: (and (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_38) 4294967296) (mod (+ v_~a~0_65 v_~b~0_53) 4294967296)) (= v_thread3Thread1of1ForFork0_~i~2_38 1) (= v_~x_3~0_49 (+ v_~c~0_70 v_~x_3~0_50))) InVars {~a~0=v_~a~0_65, ~c~0=v_~c~0_70, ~b~0=v_~b~0_53, ~x_3~0=v_~x_3~0_50} OutVars{~a~0=v_~a~0_65, ~c~0=v_~c~0_70, ~b~0=v_~b~0_53, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, ~x_3~0=v_~x_3~0_49, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:27,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:27,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 07:25:27,620 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 500 flow [2022-12-06 07:25:27,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:27,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:27,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:25:27,621 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash 279195164, now seen corresponding path program 1 times [2022-12-06 07:25:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:27,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261007293] [2022-12-06 07:25:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:27,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:25:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261007293] [2022-12-06 07:25:27,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261007293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:27,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:27,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705187402] [2022-12-06 07:25:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:27,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:27,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:25:27,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 500 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:27,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:27,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:25:27,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:28,036 INFO L130 PetriNetUnfolder]: 1087/1724 cut-off events. [2022-12-06 07:25:28,036 INFO L131 PetriNetUnfolder]: For 8007/8007 co-relation queries the response was YES. [2022-12-06 07:25:28,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7531 conditions, 1724 events. 1087/1724 cut-off events. For 8007/8007 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7974 event pairs, 482 based on Foata normal form. 2/1726 useless extension candidates. Maximal degree in co-relation 7150. Up to 1256 conditions per place. [2022-12-06 07:25:28,046 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 68 selfloop transitions, 4 changer transitions 9/81 dead transitions. [2022-12-06 07:25:28,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 792 flow [2022-12-06 07:25:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 07:25:28,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:25:28,047 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 500 flow. Second operand 5 states and 66 transitions. [2022-12-06 07:25:28,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 792 flow [2022-12-06 07:25:28,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 765 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:28,056 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 461 flow [2022-12-06 07:25:28,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2022-12-06 07:25:28,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2022-12-06 07:25:28,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:28,057 INFO L89 Accepts]: Start accepts. Operand has 75 places, 52 transitions, 461 flow [2022-12-06 07:25:28,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:28,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:28,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 52 transitions, 461 flow [2022-12-06 07:25:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 461 flow [2022-12-06 07:25:28,070 INFO L130 PetriNetUnfolder]: 55/229 cut-off events. [2022-12-06 07:25:28,070 INFO L131 PetriNetUnfolder]: For 681/720 co-relation queries the response was YES. [2022-12-06 07:25:28,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 229 events. 55/229 cut-off events. For 681/720 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1316 event pairs, 2 based on Foata normal form. 8/220 useless extension candidates. Maximal degree in co-relation 659. Up to 91 conditions per place. [2022-12-06 07:25:28,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 52 transitions, 461 flow [2022-12-06 07:25:28,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 07:25:28,073 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:28,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:25:28,073 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 461 flow [2022-12-06 07:25:28,073 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:28,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:25:28,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 914320107, now seen corresponding path program 1 times [2022-12-06 07:25:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923953815] [2022-12-06 07:25:28,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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:25:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923953815] [2022-12-06 07:25:28,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923953815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023161517] [2022-12-06 07:25:28,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:25:28,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:28,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:25:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:28,355 INFO L130 PetriNetUnfolder]: 1098/1733 cut-off events. [2022-12-06 07:25:28,355 INFO L131 PetriNetUnfolder]: For 7867/7867 co-relation queries the response was YES. [2022-12-06 07:25:28,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 1733 events. 1098/1733 cut-off events. For 7867/7867 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7953 event pairs, 562 based on Foata normal form. 8/1741 useless extension candidates. Maximal degree in co-relation 7304. Up to 1460 conditions per place. [2022-12-06 07:25:28,365 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 57 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2022-12-06 07:25:28,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 686 flow [2022-12-06 07:25:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 07:25:28,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:25:28,366 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 461 flow. Second operand 4 states and 56 transitions. [2022-12-06 07:25:28,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 686 flow [2022-12-06 07:25:28,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 652 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 07:25:28,376 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 494 flow [2022-12-06 07:25:28,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2022-12-06 07:25:28,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2022-12-06 07:25:28,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:28,376 INFO L89 Accepts]: Start accepts. Operand has 69 places, 54 transitions, 494 flow [2022-12-06 07:25:28,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:28,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:28,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 54 transitions, 494 flow [2022-12-06 07:25:28,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 54 transitions, 494 flow [2022-12-06 07:25:28,389 INFO L130 PetriNetUnfolder]: 56/232 cut-off events. [2022-12-06 07:25:28,389 INFO L131 PetriNetUnfolder]: For 722/755 co-relation queries the response was YES. [2022-12-06 07:25:28,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 232 events. 56/232 cut-off events. For 722/755 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1329 event pairs, 2 based on Foata normal form. 8/223 useless extension candidates. Maximal degree in co-relation 664. Up to 93 conditions per place. [2022-12-06 07:25:28,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 54 transitions, 494 flow [2022-12-06 07:25:28,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 07:25:28,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L57-5: Formula: (and (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_45) 4294967296) (mod (+ v_~a~0_81 v_~b~0_69) 4294967296)) (= 2 v_thread3Thread1of1ForFork0_~i~2_45) (= (+ v_~x_3~0_56 (* v_~c~0_80 2)) v_~x_3~0_54)) InVars {~a~0=v_~a~0_81, ~c~0=v_~c~0_80, ~b~0=v_~b~0_69, ~x_3~0=v_~x_3~0_56} OutVars{~a~0=v_~a~0_81, ~c~0=v_~c~0_80, ~b~0=v_~b~0_69, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~x_3~0=v_~x_3~0_54, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_22|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:28,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:28,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:25:28,470 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 491 flow [2022-12-06 07:25:28,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:28,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:25:28,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1487690506, now seen corresponding path program 1 times [2022-12-06 07:25:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219243496] [2022-12-06 07:25:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,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:25:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219243496] [2022-12-06 07:25:28,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219243496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82800161] [2022-12-06 07:25:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 07:25:28,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 491 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 07:25:28,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:28,746 INFO L130 PetriNetUnfolder]: 1017/1622 cut-off events. [2022-12-06 07:25:28,747 INFO L131 PetriNetUnfolder]: For 7550/7615 co-relation queries the response was YES. [2022-12-06 07:25:28,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6879 conditions, 1622 events. 1017/1622 cut-off events. For 7550/7615 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7910 event pairs, 287 based on Foata normal form. 47/1654 useless extension candidates. Maximal degree in co-relation 6516. Up to 1469 conditions per place. [2022-12-06 07:25:28,755 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 55 selfloop transitions, 12 changer transitions 5/76 dead transitions. [2022-12-06 07:25:28,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 733 flow [2022-12-06 07:25:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 07:25:28,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-06 07:25:28,756 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 491 flow. Second operand 4 states and 67 transitions. [2022-12-06 07:25:28,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 733 flow [2022-12-06 07:25:28,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 703 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:28,765 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 520 flow [2022-12-06 07:25:28,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=520, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2022-12-06 07:25:28,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2022-12-06 07:25:28,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:28,765 INFO L89 Accepts]: Start accepts. Operand has 70 places, 55 transitions, 520 flow [2022-12-06 07:25:28,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:28,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:28,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 55 transitions, 520 flow [2022-12-06 07:25:28,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 55 transitions, 520 flow [2022-12-06 07:25:28,778 INFO L130 PetriNetUnfolder]: 57/237 cut-off events. [2022-12-06 07:25:28,778 INFO L131 PetriNetUnfolder]: For 838/885 co-relation queries the response was YES. [2022-12-06 07:25:28,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 237 events. 57/237 cut-off events. For 838/885 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1365 event pairs, 2 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 704. Up to 94 conditions per place. [2022-12-06 07:25:28,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 55 transitions, 520 flow [2022-12-06 07:25:28,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 07:25:28,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L49-5: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_49 1) (= (+ v_~c~0_82 v_~x_3~0_61) v_~x_3~0_60) (= v_thread2Thread1of1ForFork2_~i~1_61 (+ v_thread2Thread1of1ForFork2_~i~1_62 1)) (= (+ v_~c~0_82 v_~x_2~0_65) v_~x_2~0_64) (< (mod v_thread2Thread1of1ForFork2_~i~1_62 4294967296) (mod v_~b~0_71 4294967296)) (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_49) 4294967296) (mod (+ v_~a~0_83 v_~b~0_71) 4294967296))) InVars {~a~0=v_~a~0_83, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_62, ~c~0=v_~c~0_82, ~b~0=v_~b~0_71, ~x_2~0=v_~x_2~0_65, ~x_3~0=v_~x_3~0_61} OutVars{~a~0=v_~a~0_83, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_61, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_28|, ~c~0=v_~c~0_82, ~b~0=v_~b~0_71, ~x_2~0=v_~x_2~0_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_49, ~x_3~0=v_~x_3~0_60, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_26|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0, thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 07:25:28,904 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:28,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 07:25:28,905 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 527 flow [2022-12-06 07:25:28,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:25:28,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -337733152, now seen corresponding path program 1 times [2022-12-06 07:25:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823867970] [2022-12-06 07:25:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823867970] [2022-12-06 07:25:28,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823867970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:28,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:28,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660655029] [2022-12-06 07:25:28,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:28,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:28,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:25:28,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (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,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:28,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:25:28,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,175 INFO L130 PetriNetUnfolder]: 1039/1634 cut-off events. [2022-12-06 07:25:29,175 INFO L131 PetriNetUnfolder]: For 8515/8529 co-relation queries the response was YES. [2022-12-06 07:25:29,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 1634 events. 1039/1634 cut-off events. For 8515/8529 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7580 event pairs, 501 based on Foata normal form. 26/1634 useless extension candidates. Maximal degree in co-relation 6793. Up to 1417 conditions per place. [2022-12-06 07:25:29,183 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 57 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2022-12-06 07:25:29,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 763 flow [2022-12-06 07:25:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 07:25:29,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2022-12-06 07:25:29,184 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 527 flow. Second operand 5 states and 68 transitions. [2022-12-06 07:25:29,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 763 flow [2022-12-06 07:25:29,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 702 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:29,198 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 528 flow [2022-12-06 07:25:29,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2022-12-06 07:25:29,198 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2022-12-06 07:25:29,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:29,198 INFO L89 Accepts]: Start accepts. Operand has 71 places, 55 transitions, 528 flow [2022-12-06 07:25:29,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:29,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:29,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 55 transitions, 528 flow [2022-12-06 07:25:29,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 55 transitions, 528 flow [2022-12-06 07:25:29,211 INFO L130 PetriNetUnfolder]: 58/224 cut-off events. [2022-12-06 07:25:29,211 INFO L131 PetriNetUnfolder]: For 745/779 co-relation queries the response was YES. [2022-12-06 07:25:29,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 224 events. 58/224 cut-off events. For 745/779 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1216 event pairs, 2 based on Foata normal form. 8/216 useless extension candidates. Maximal degree in co-relation 681. Up to 93 conditions per place. [2022-12-06 07:25:29,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 55 transitions, 528 flow [2022-12-06 07:25:29,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 07:25:29,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L57-5: Formula: (and (= (+ v_~c~0_88 v_~x_2~0_73) v_~x_2~0_72) (= v_thread2Thread1of1ForFork2_~i~1_69 (+ v_thread2Thread1of1ForFork2_~i~1_70 1)) (= 2 v_thread3Thread1of1ForFork0_~i~2_57) (= v_~x_3~0_74 (+ v_~x_3~0_76 (* v_~c~0_88 2))) (< 1 (mod (+ v_~a~0_89 v_~b~0_77) 4294967296)) (< (mod v_thread2Thread1of1ForFork2_~i~1_70 4294967296) (mod v_~b~0_77 4294967296))) InVars {~a~0=v_~a~0_89, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_70, ~c~0=v_~c~0_88, ~b~0=v_~b~0_77, ~x_2~0=v_~x_2~0_73, ~x_3~0=v_~x_3~0_76} OutVars{~a~0=v_~a~0_89, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_69, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_32|, ~c~0=v_~c~0_88, ~b~0=v_~b~0_77, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_57, ~x_2~0=v_~x_2~0_72, ~x_3~0=v_~x_3~0_74, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_34|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, thread3Thread1of1ForFork0_~i~2, ~x_2~0, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:29,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:29,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 07:25:29,274 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 535 flow [2022-12-06 07:25:29,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (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,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:29,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:25:29,274 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2062324218, now seen corresponding path program 1 times [2022-12-06 07:25:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:29,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022744074] [2022-12-06 07:25:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:29,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:25:29,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:29,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022744074] [2022-12-06 07:25:29,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022744074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:29,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:29,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820083714] [2022-12-06 07:25:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:29,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:29,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:29,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:29,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:25:29,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 535 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:29,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:29,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:25:29,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:29,795 INFO L130 PetriNetUnfolder]: 1114/1741 cut-off events. [2022-12-06 07:25:29,795 INFO L131 PetriNetUnfolder]: For 7880/7880 co-relation queries the response was YES. [2022-12-06 07:25:29,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 1741 events. 1114/1741 cut-off events. For 7880/7880 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7895 event pairs, 544 based on Foata normal form. 20/1761 useless extension candidates. Maximal degree in co-relation 7211. Up to 1498 conditions per place. [2022-12-06 07:25:29,803 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 68 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2022-12-06 07:25:29,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 831 flow [2022-12-06 07:25:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 07:25:29,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2022-12-06 07:25:29,805 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 535 flow. Second operand 5 states and 69 transitions. [2022-12-06 07:25:29,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 831 flow [2022-12-06 07:25:29,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 777 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:29,818 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 560 flow [2022-12-06 07:25:29,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2022-12-06 07:25:29,818 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2022-12-06 07:25:29,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:29,818 INFO L89 Accepts]: Start accepts. Operand has 74 places, 58 transitions, 560 flow [2022-12-06 07:25:29,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:29,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:29,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 58 transitions, 560 flow [2022-12-06 07:25:29,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 58 transitions, 560 flow [2022-12-06 07:25:29,833 INFO L130 PetriNetUnfolder]: 72/262 cut-off events. [2022-12-06 07:25:29,833 INFO L131 PetriNetUnfolder]: For 1137/1202 co-relation queries the response was YES. [2022-12-06 07:25:29,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 262 events. 72/262 cut-off events. For 1137/1202 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1495 event pairs, 2 based on Foata normal form. 9/248 useless extension candidates. Maximal degree in co-relation 867. Up to 109 conditions per place. [2022-12-06 07:25:29,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 58 transitions, 560 flow [2022-12-06 07:25:29,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 07:25:29,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L49-5: Formula: (let ((.cse0 (mod v_~b~0_79 4294967296))) (and (= (+ 2 v_thread2Thread1of1ForFork2_~i~1_75) v_thread2Thread1of1ForFork2_~i~1_73) (= v_thread3Thread1of1ForFork0_~i~2_61 1) (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_61) 4294967296) (mod (+ v_~a~0_91 v_~b~0_79) 4294967296)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_73) 4294967296) .cse0) (< (mod v_thread2Thread1of1ForFork2_~i~1_75 4294967296) .cse0) (= v_~x_2~0_76 (+ v_~x_2~0_78 (* v_~c~0_90 2))) (= v_~x_3~0_80 (+ v_~c~0_90 v_~x_3~0_81)))) InVars {~a~0=v_~a~0_91, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_75, ~c~0=v_~c~0_90, ~b~0=v_~b~0_79, ~x_2~0=v_~x_2~0_78, ~x_3~0=v_~x_3~0_81} OutVars{~a~0=v_~a~0_91, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_73, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_34|, ~c~0=v_~c~0_90, ~b~0=v_~b~0_79, ~x_2~0=v_~x_2~0_76, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_61, ~x_3~0=v_~x_3~0_80, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_38|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0, thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 07:25:30,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:30,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 07:25:30,023 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 586 flow [2022-12-06 07:25:30,023 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:30,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:30,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:30,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:25:30,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1345139397, now seen corresponding path program 1 times [2022-12-06 07:25:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234653179] [2022-12-06 07:25:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,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:25:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:30,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234653179] [2022-12-06 07:25:30,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234653179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:30,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:30,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:25:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274527717] [2022-12-06 07:25:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:30,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:30,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:30,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-06 07:25:30,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 586 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-06 07:25:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:30,286 INFO L130 PetriNetUnfolder]: 1037/1642 cut-off events. [2022-12-06 07:25:30,286 INFO L131 PetriNetUnfolder]: For 11477/11540 co-relation queries the response was YES. [2022-12-06 07:25:30,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7824 conditions, 1642 events. 1037/1642 cut-off events. For 11477/11540 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7854 event pairs, 345 based on Foata normal form. 45/1672 useless extension candidates. Maximal degree in co-relation 7533. Up to 1485 conditions per place. [2022-12-06 07:25:30,294 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 57 selfloop transitions, 14 changer transitions 6/81 dead transitions. [2022-12-06 07:25:30,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 854 flow [2022-12-06 07:25:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 07:25:30,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-06 07:25:30,296 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 586 flow. Second operand 4 states and 70 transitions. [2022-12-06 07:25:30,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 854 flow [2022-12-06 07:25:30,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 807 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:30,310 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 587 flow [2022-12-06 07:25:30,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=587, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2022-12-06 07:25:30,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2022-12-06 07:25:30,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,310 INFO L89 Accepts]: Start accepts. Operand has 76 places, 59 transitions, 587 flow [2022-12-06 07:25:30,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 59 transitions, 587 flow [2022-12-06 07:25:30,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 59 transitions, 587 flow [2022-12-06 07:25:30,336 INFO L130 PetriNetUnfolder]: 75/268 cut-off events. [2022-12-06 07:25:30,336 INFO L131 PetriNetUnfolder]: For 1425/1514 co-relation queries the response was YES. [2022-12-06 07:25:30,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 268 events. 75/268 cut-off events. For 1425/1514 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1539 event pairs, 2 based on Foata normal form. 9/252 useless extension candidates. Maximal degree in co-relation 951. Up to 112 conditions per place. [2022-12-06 07:25:30,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 59 transitions, 587 flow [2022-12-06 07:25:30,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 07:25:30,339 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:30,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 07:25:30,340 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 587 flow [2022-12-06 07:25:30,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:30,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:30,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:25:30,340 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1092628300, now seen corresponding path program 1 times [2022-12-06 07:25:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:30,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88534282] [2022-12-06 07:25:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,428 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:30,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:30,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88534282] [2022-12-06 07:25:30,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88534282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:30,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63910970] [2022-12-06 07:25:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:30,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:30,430 INFO L229 MonitoredProcess]: Starting monitored process 4 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:30,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:25:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:30,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:25:30,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:30,542 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:30,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:30,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63910970] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:30,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:25:30,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2022-12-06 07:25:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338514289] [2022-12-06 07:25:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:25:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:25:30,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:30,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 07:25:30,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (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,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 07:25:30,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:30,711 INFO L130 PetriNetUnfolder]: 1023/1603 cut-off events. [2022-12-06 07:25:30,711 INFO L131 PetriNetUnfolder]: For 12200/12264 co-relation queries the response was YES. [2022-12-06 07:25:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7811 conditions, 1603 events. 1023/1603 cut-off events. For 12200/12264 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7513 event pairs, 339 based on Foata normal form. 48/1636 useless extension candidates. Maximal degree in co-relation 7622. Up to 1489 conditions per place. [2022-12-06 07:25:30,719 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 52 selfloop transitions, 11 changer transitions 4/71 dead transitions. [2022-12-06 07:25:30,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 755 flow [2022-12-06 07:25:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:25:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:25:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 07:25:30,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-06 07:25:30,720 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 587 flow. Second operand 3 states and 56 transitions. [2022-12-06 07:25:30,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 755 flow [2022-12-06 07:25:30,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 713 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:30,735 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 550 flow [2022-12-06 07:25:30,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2022-12-06 07:25:30,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 07:25:30,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:30,736 INFO L89 Accepts]: Start accepts. Operand has 73 places, 58 transitions, 550 flow [2022-12-06 07:25:30,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:30,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:30,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 58 transitions, 550 flow [2022-12-06 07:25:30,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 58 transitions, 550 flow [2022-12-06 07:25:30,750 INFO L130 PetriNetUnfolder]: 75/261 cut-off events. [2022-12-06 07:25:30,750 INFO L131 PetriNetUnfolder]: For 1315/1381 co-relation queries the response was YES. [2022-12-06 07:25:30,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 261 events. 75/261 cut-off events. For 1315/1381 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1461 event pairs, 2 based on Foata normal form. 7/244 useless extension candidates. Maximal degree in co-relation 856. Up to 108 conditions per place. [2022-12-06 07:25:30,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 58 transitions, 550 flow [2022-12-06 07:25:30,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 07:25:30,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:30,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:25:30,753 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 550 flow [2022-12-06 07:25:30,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (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,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:30,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:30,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:30,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:30,960 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1846577865, now seen corresponding path program 1 times [2022-12-06 07:25:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:30,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867904253] [2022-12-06 07:25:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:31,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867904253] [2022-12-06 07:25:31,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867904253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:31,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:31,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:25:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923657237] [2022-12-06 07:25:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:31,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:31,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 07:25:31,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:31,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 07:25:31,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:31,365 INFO L130 PetriNetUnfolder]: 1093/1718 cut-off events. [2022-12-06 07:25:31,365 INFO L131 PetriNetUnfolder]: For 12494/12507 co-relation queries the response was YES. [2022-12-06 07:25:31,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1718 events. 1093/1718 cut-off events. For 12494/12507 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8124 event pairs, 407 based on Foata normal form. 4/1695 useless extension candidates. Maximal degree in co-relation 7366. Up to 1240 conditions per place. [2022-12-06 07:25:31,373 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 92 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2022-12-06 07:25:31,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 977 flow [2022-12-06 07:25:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:25:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:25:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 07:25:31,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3963963963963964 [2022-12-06 07:25:31,375 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 550 flow. Second operand 6 states and 88 transitions. [2022-12-06 07:25:31,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 977 flow [2022-12-06 07:25:31,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:31,389 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 590 flow [2022-12-06 07:25:31,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2022-12-06 07:25:31,390 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-06 07:25:31,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:31,390 INFO L89 Accepts]: Start accepts. Operand has 80 places, 61 transitions, 590 flow [2022-12-06 07:25:31,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:31,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:31,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 61 transitions, 590 flow [2022-12-06 07:25:31,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 61 transitions, 590 flow [2022-12-06 07:25:31,405 INFO L130 PetriNetUnfolder]: 76/273 cut-off events. [2022-12-06 07:25:31,405 INFO L131 PetriNetUnfolder]: For 1325/1402 co-relation queries the response was YES. [2022-12-06 07:25:31,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 273 events. 76/273 cut-off events. For 1325/1402 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1591 event pairs, 2 based on Foata normal form. 7/256 useless extension candidates. Maximal degree in co-relation 942. Up to 112 conditions per place. [2022-12-06 07:25:31,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 61 transitions, 590 flow [2022-12-06 07:25:31,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 07:25:31,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [351] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_14| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_32 4294967296) (mod (+ v_~a~0_59 v_~b~0_47) 4294967296))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_14|) (= v_thread3Thread1of1ForFork0_~i~2_32 0)) InVars {~a~0=v_~a~0_59, ~b~0=v_~b~0_47} OutVars{~a~0=v_~a~0_59, ~b~0=v_~b~0_47, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_14|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_32, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] [2022-12-06 07:25:31,518 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:31,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-06 07:25:31,519 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 589 flow [2022-12-06 07:25:31,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:31,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:31,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:25:31,520 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1236145212, now seen corresponding path program 1 times [2022-12-06 07:25:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:31,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581669502] [2022-12-06 07:25:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:31,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:25:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:31,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581669502] [2022-12-06 07:25:31,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581669502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:31,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:31,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138362614] [2022-12-06 07:25:31,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:31,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:31,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:31,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:31,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:25:31,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:31,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:31,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:25:31,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:31,901 INFO L130 PetriNetUnfolder]: 1479/2297 cut-off events. [2022-12-06 07:25:31,902 INFO L131 PetriNetUnfolder]: For 16003/16003 co-relation queries the response was YES. [2022-12-06 07:25:31,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11231 conditions, 2297 events. 1479/2297 cut-off events. For 16003/16003 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10903 event pairs, 492 based on Foata normal form. 4/2301 useless extension candidates. Maximal degree in co-relation 10848. Up to 1353 conditions per place. [2022-12-06 07:25:31,914 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 103 selfloop transitions, 14 changer transitions 2/119 dead transitions. [2022-12-06 07:25:31,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 1279 flow [2022-12-06 07:25:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 07:25:31,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2022-12-06 07:25:31,916 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 589 flow. Second operand 5 states and 88 transitions. [2022-12-06 07:25:31,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 1279 flow [2022-12-06 07:25:31,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 119 transitions, 1232 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:31,946 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 688 flow [2022-12-06 07:25:31,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=688, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2022-12-06 07:25:31,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-06 07:25:31,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:31,946 INFO L89 Accepts]: Start accepts. Operand has 83 places, 65 transitions, 688 flow [2022-12-06 07:25:31,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:31,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:31,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 65 transitions, 688 flow [2022-12-06 07:25:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 65 transitions, 688 flow [2022-12-06 07:25:31,966 INFO L130 PetriNetUnfolder]: 99/340 cut-off events. [2022-12-06 07:25:31,966 INFO L131 PetriNetUnfolder]: For 2130/2214 co-relation queries the response was YES. [2022-12-06 07:25:31,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 340 events. 99/340 cut-off events. For 2130/2214 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2069 event pairs, 5 based on Foata normal form. 12/328 useless extension candidates. Maximal degree in co-relation 1261. Up to 148 conditions per place. [2022-12-06 07:25:31,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 65 transitions, 688 flow [2022-12-06 07:25:31,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 07:25:31,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->L49-5: Formula: (and (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_45) 4294967296) (mod v_~b~0_59 4294967296)) (= v_thread2Thread1of1ForFork2_~i~1_45 1) (= v_~x_2~0_60 (+ v_~c~0_76 v_~x_2~0_61))) InVars {~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_61} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_45, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_26|, ~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] [2022-12-06 07:25:31,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] $Ultimate##0-->L57-5: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_74 0) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_98) 4294967296) (mod v_~b~0_89 4294967296)) (= (+ v_~x_2~0_99 v_~c~0_100) v_~x_2~0_98) (= v_thread2Thread1of1ForFork2_~i~1_98 1)) InVars {~c~0=v_~c~0_100, ~b~0=v_~b~0_89, ~x_2~0=v_~x_2~0_99} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_98, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_48|, ~c~0=v_~c~0_100, ~b~0=v_~b~0_89, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_74, ~x_2~0=v_~x_2~0_98} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, thread3Thread1of1ForFork0_~i~2, ~x_2~0] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:32,033 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:32,034 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 07:25:32,034 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 695 flow [2022-12-06 07:25:32,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:32,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:32,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:25:32,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash -868885621, now seen corresponding path program 1 times [2022-12-06 07:25:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:32,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074844281] [2022-12-06 07:25:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074844281] [2022-12-06 07:25:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074844281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:32,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448263815] [2022-12-06 07:25:32,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:32,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:32,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 07:25:32,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 695 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (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,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:32,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 07:25:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:32,457 INFO L130 PetriNetUnfolder]: 1391/2182 cut-off events. [2022-12-06 07:25:32,458 INFO L131 PetriNetUnfolder]: For 19789/19830 co-relation queries the response was YES. [2022-12-06 07:25:32,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 2182 events. 1391/2182 cut-off events. For 19789/19830 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10648 event pairs, 607 based on Foata normal form. 32/2187 useless extension candidates. Maximal degree in co-relation 10904. Up to 1512 conditions per place. [2022-12-06 07:25:32,468 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 84 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2022-12-06 07:25:32,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 96 transitions, 1044 flow [2022-12-06 07:25:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 07:25:32,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 07:25:32,469 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 695 flow. Second operand 5 states and 75 transitions. [2022-12-06 07:25:32,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 96 transitions, 1044 flow [2022-12-06 07:25:32,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 1013 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:32,490 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 675 flow [2022-12-06 07:25:32,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=675, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2022-12-06 07:25:32,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2022-12-06 07:25:32,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:32,490 INFO L89 Accepts]: Start accepts. Operand has 87 places, 65 transitions, 675 flow [2022-12-06 07:25:32,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:32,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:32,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 65 transitions, 675 flow [2022-12-06 07:25:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 65 transitions, 675 flow [2022-12-06 07:25:32,511 INFO L130 PetriNetUnfolder]: 99/342 cut-off events. [2022-12-06 07:25:32,511 INFO L131 PetriNetUnfolder]: For 2064/2159 co-relation queries the response was YES. [2022-12-06 07:25:32,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 342 events. 99/342 cut-off events. For 2064/2159 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2081 event pairs, 6 based on Foata normal form. 12/329 useless extension candidates. Maximal degree in co-relation 1267. Up to 149 conditions per place. [2022-12-06 07:25:32,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 65 transitions, 675 flow [2022-12-06 07:25:32,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 07:25:32,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L57-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_In_2 4294967296) (mod (+ v_~a~0_In_3 v_~b~0_In_3) 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_2, ~a~0=v_~a~0_In_3, ~b~0=v_~b~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_2, ~a~0=v_~a~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~b~0=v_~b~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [356] $Ultimate##0-->L49-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_41 1) (= v_~x_2~0_56 (+ v_~c~0_74 v_~x_2~0_57)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_41) 4294967296) (mod v_~b~0_57 4294967296))) InVars {~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_57} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_24|, ~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:32,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L49-5-->thread3EXIT: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_72 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_18|) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_96 4294967296) (mod v_~b~0_87 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_18| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_72 4294967296) (mod (+ v_~b~0_87 v_~a~0_101) 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.offset_24| 0) (= |v_thread2Thread1of1ForFork2_#res.base_24| 0)) InVars {~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, ~b~0=v_~b~0_87} OutVars{~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_24|, ~b~0=v_~b~0_87, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_18|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_72, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_18|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork2_#res.offset] and [356] $Ultimate##0-->L49-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_41 1) (= v_~x_2~0_56 (+ v_~c~0_74 v_~x_2~0_57)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_41) 4294967296) (mod v_~b~0_57 4294967296))) InVars {~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_57} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_24|, ~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:32,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_14| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_32 4294967296) (mod (+ v_~a~0_59 v_~b~0_47) 4294967296))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_14|) (= v_thread3Thread1of1ForFork0_~i~2_32 0)) InVars {~a~0=v_~a~0_59, ~b~0=v_~b~0_47} OutVars{~a~0=v_~a~0_59, ~b~0=v_~b~0_47, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_14|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_32, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [356] $Ultimate##0-->L49-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_41 1) (= v_~x_2~0_56 (+ v_~c~0_74 v_~x_2~0_57)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_41) 4294967296) (mod v_~b~0_57 4294967296))) InVars {~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_57} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_24|, ~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 07:25:32,739 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:32,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 07:25:32,740 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 745 flow [2022-12-06 07:25:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (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,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:32,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:32,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:25:32,740 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 182603322, now seen corresponding path program 2 times [2022-12-06 07:25:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:32,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552733044] [2022-12-06 07:25:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:32,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:25:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552733044] [2022-12-06 07:25:32,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552733044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:32,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:32,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:25:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66655705] [2022-12-06 07:25:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:32,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:25:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:32,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:25:32,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:25:32,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:25:32,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 745 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:32,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:32,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:25:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:33,225 INFO L130 PetriNetUnfolder]: 1553/2443 cut-off events. [2022-12-06 07:25:33,226 INFO L131 PetriNetUnfolder]: For 18762/18762 co-relation queries the response was YES. [2022-12-06 07:25:33,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12486 conditions, 2443 events. 1553/2443 cut-off events. For 18762/18762 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11993 event pairs, 540 based on Foata normal form. 20/2463 useless extension candidates. Maximal degree in co-relation 11932. Up to 1363 conditions per place. [2022-12-06 07:25:33,239 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 109 selfloop transitions, 26 changer transitions 1/136 dead transitions. [2022-12-06 07:25:33,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 136 transitions, 1432 flow [2022-12-06 07:25:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:25:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:25:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 07:25:33,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2022-12-06 07:25:33,240 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 745 flow. Second operand 7 states and 111 transitions. [2022-12-06 07:25:33,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 136 transitions, 1432 flow [2022-12-06 07:25:33,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 1388 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:33,268 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 909 flow [2022-12-06 07:25:33,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=909, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2022-12-06 07:25:33,268 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2022-12-06 07:25:33,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,269 INFO L89 Accepts]: Start accepts. Operand has 91 places, 77 transitions, 909 flow [2022-12-06 07:25:33,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 77 transitions, 909 flow [2022-12-06 07:25:33,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 77 transitions, 909 flow [2022-12-06 07:25:33,292 INFO L130 PetriNetUnfolder]: 108/388 cut-off events. [2022-12-06 07:25:33,292 INFO L131 PetriNetUnfolder]: For 2786/2936 co-relation queries the response was YES. [2022-12-06 07:25:33,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 388 events. 108/388 cut-off events. For 2786/2936 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2538 event pairs, 5 based on Foata normal form. 14/378 useless extension candidates. Maximal degree in co-relation 1461. Up to 163 conditions per place. [2022-12-06 07:25:33,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 77 transitions, 909 flow [2022-12-06 07:25:33,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 07:25:33,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->L49-5: Formula: (and (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_45) 4294967296) (mod v_~b~0_59 4294967296)) (= v_thread2Thread1of1ForFork2_~i~1_45 1) (= v_~x_2~0_60 (+ v_~c~0_76 v_~x_2~0_61))) InVars {~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_61} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_45, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_26|, ~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] [2022-12-06 07:25:33,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 07:25:33,363 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:33,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 07:25:33,363 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 924 flow [2022-12-06 07:25:33,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:33,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:33,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:33,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:25:33,364 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1807388423, now seen corresponding path program 1 times [2022-12-06 07:25:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:33,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658970758] [2022-12-06 07:25:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:33,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:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658970758] [2022-12-06 07:25:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658970758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:33,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:33,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:25:33,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55072631] [2022-12-06 07:25:33,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:33,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:33,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:33,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:33,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:33,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:25:33,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 924 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (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,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:33,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:25:33,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:33,790 INFO L130 PetriNetUnfolder]: 1459/2322 cut-off events. [2022-12-06 07:25:33,790 INFO L131 PetriNetUnfolder]: For 23022/23071 co-relation queries the response was YES. [2022-12-06 07:25:33,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12335 conditions, 2322 events. 1459/2322 cut-off events. For 23022/23071 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11790 event pairs, 653 based on Foata normal form. 36/2334 useless extension candidates. Maximal degree in co-relation 11779. Up to 1674 conditions per place. [2022-12-06 07:25:33,802 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 91 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2022-12-06 07:25:33,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 107 transitions, 1281 flow [2022-12-06 07:25:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-06 07:25:33,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 07:25:33,803 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 924 flow. Second operand 5 states and 77 transitions. [2022-12-06 07:25:33,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 107 transitions, 1281 flow [2022-12-06 07:25:33,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 1243 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-12-06 07:25:33,840 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 897 flow [2022-12-06 07:25:33,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=897, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2022-12-06 07:25:33,840 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2022-12-06 07:25:33,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,840 INFO L89 Accepts]: Start accepts. Operand has 96 places, 77 transitions, 897 flow [2022-12-06 07:25:33,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 77 transitions, 897 flow [2022-12-06 07:25:33,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 77 transitions, 897 flow [2022-12-06 07:25:33,864 INFO L130 PetriNetUnfolder]: 106/393 cut-off events. [2022-12-06 07:25:33,865 INFO L131 PetriNetUnfolder]: For 2641/2808 co-relation queries the response was YES. [2022-12-06 07:25:33,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 393 events. 106/393 cut-off events. For 2641/2808 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2593 event pairs, 6 based on Foata normal form. 17/382 useless extension candidates. Maximal degree in co-relation 1456. Up to 162 conditions per place. [2022-12-06 07:25:33,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 77 transitions, 897 flow [2022-12-06 07:25:33,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 07:25:33,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 07:25:33,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L49-5-->thread3EXIT: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_72 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_18|) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_96 4294967296) (mod v_~b~0_87 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_18| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_72 4294967296) (mod (+ v_~b~0_87 v_~a~0_101) 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.offset_24| 0) (= |v_thread2Thread1of1ForFork2_#res.base_24| 0)) InVars {~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, ~b~0=v_~b~0_87} OutVars{~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_24|, ~b~0=v_~b~0_87, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_18|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_72, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_18|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork2_#res.offset] and [377] $Ultimate##0-->L41-5: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_60 3) (< 2 (mod v_~a~0_103 4294967296)) (= (+ v_~x_1~0_67 (* 3 v_~c~0_104)) v_~x_1~0_65)) InVars {~a~0=v_~a~0_103, ~c~0=v_~c~0_104, ~x_1~0=v_~x_1~0_67} OutVars{~a~0=v_~a~0_103, ~c~0=v_~c~0_104, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_60, ~x_1~0=v_~x_1~0_65} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 07:25:34,139 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:34,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 300 [2022-12-06 07:25:34,140 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 894 flow [2022-12-06 07:25:34,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (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,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:25:34,140 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash 18366823, now seen corresponding path program 1 times [2022-12-06 07:25:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337363217] [2022-12-06 07:25:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,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:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337363217] [2022-12-06 07:25:34,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337363217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:25:34,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071353048] [2022-12-06 07:25:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:25:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:25:34,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:25:34,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 07:25:34,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 894 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (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,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 07:25:34,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:34,583 INFO L130 PetriNetUnfolder]: 1531/2457 cut-off events. [2022-12-06 07:25:34,583 INFO L131 PetriNetUnfolder]: For 21345/21454 co-relation queries the response was YES. [2022-12-06 07:25:34,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13255 conditions, 2457 events. 1531/2457 cut-off events. For 21345/21454 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13094 event pairs, 331 based on Foata normal form. 87/2533 useless extension candidates. Maximal degree in co-relation 12679. Up to 1953 conditions per place. [2022-12-06 07:25:34,595 INFO L137 encePairwiseOnDemand]: 23/41 looper letters, 83 selfloop transitions, 36 changer transitions 5/128 dead transitions. [2022-12-06 07:25:34,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 1516 flow [2022-12-06 07:25:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:25:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:25:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-06 07:25:34,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4585365853658537 [2022-12-06 07:25:34,596 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 894 flow. Second operand 5 states and 94 transitions. [2022-12-06 07:25:34,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 1516 flow [2022-12-06 07:25:34,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1470 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:34,634 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 1167 flow [2022-12-06 07:25:34,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1167, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2022-12-06 07:25:34,635 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2022-12-06 07:25:34,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:34,635 INFO L89 Accepts]: Start accepts. Operand has 97 places, 91 transitions, 1167 flow [2022-12-06 07:25:34,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:34,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:34,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 91 transitions, 1167 flow [2022-12-06 07:25:34,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 91 transitions, 1167 flow [2022-12-06 07:25:34,663 INFO L130 PetriNetUnfolder]: 114/427 cut-off events. [2022-12-06 07:25:34,663 INFO L131 PetriNetUnfolder]: For 3257/3386 co-relation queries the response was YES. [2022-12-06 07:25:34,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 427 events. 114/427 cut-off events. For 3257/3386 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2938 event pairs, 2 based on Foata normal form. 23/425 useless extension candidates. Maximal degree in co-relation 1729. Up to 177 conditions per place. [2022-12-06 07:25:34,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 91 transitions, 1167 flow [2022-12-06 07:25:34,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 07:25:34,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 07:25:34,807 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:34,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:25:34,808 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 1200 flow [2022-12-06 07:25:34,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (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,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:25:34,808 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1014931543, now seen corresponding path program 1 times [2022-12-06 07:25:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167996570] [2022-12-06 07:25:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,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:25:34,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167996570] [2022-12-06 07:25:34,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167996570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129908068] [2022-12-06 07:25:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:34,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:34,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:34,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,200 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:35,200 INFO L131 PetriNetUnfolder]: For 27270/27316 co-relation queries the response was YES. [2022-12-06 07:25:35,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14413 conditions, 2583 events. 1614/2583 cut-off events. For 27270/27316 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13550 event pairs, 779 based on Foata normal form. 34/2590 useless extension candidates. Maximal degree in co-relation 13581. Up to 1861 conditions per place. [2022-12-06 07:25:35,215 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:35,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 1573 flow [2022-12-06 07:25:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:35,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:35,218 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 1200 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:35,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 1573 flow [2022-12-06 07:25:35,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:35,258 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:35,259 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:35,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:35,259 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:35,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:35,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,308 INFO L130 PetriNetUnfolder]: 112/426 cut-off events. [2022-12-06 07:25:35,308 INFO L131 PetriNetUnfolder]: For 3048/3187 co-relation queries the response was YES. [2022-12-06 07:25:35,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 426 events. 112/426 cut-off events. For 3048/3187 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2937 event pairs, 2 based on Foata normal form. 23/423 useless extension candidates. Maximal degree in co-relation 1743. Up to 166 conditions per place. [2022-12-06 07:25:35,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:35,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [387] L49-5-->L57-5: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_100 (+ v_thread3Thread1of1ForFork0_~i~2_101 1)) (< (mod v_thread2Thread1of1ForFork2_~i~1_127 4294967296) (mod v_~b~0_111 4294967296)) (< (mod v_thread3Thread1of1ForFork0_~i~2_101 4294967296) (mod (+ v_~a~0_121 v_~b~0_111) 4294967296)) (= (+ v_~c~0_124 v_~x_2~0_135) v_~x_2~0_134) (= v_thread2Thread1of1ForFork2_~i~1_126 (+ v_thread2Thread1of1ForFork2_~i~1_127 1)) (= (+ v_~c~0_124 v_~x_3~0_108) v_~x_3~0_107)) InVars {~a~0=v_~a~0_121, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_127, ~c~0=v_~c~0_124, ~b~0=v_~b~0_111, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_101, ~x_2~0=v_~x_2~0_135, ~x_3~0=v_~x_3~0_108} OutVars{~a~0=v_~a~0_121, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_126, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_68|, ~c~0=v_~c~0_124, ~b~0=v_~b~0_111, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_100, ~x_2~0=v_~x_2~0_134, ~x_3~0=v_~x_3~0_107, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, thread3Thread1of1ForFork0_~i~2, ~x_2~0, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 07:25:35,502 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:35,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 07:25:35,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1193 flow [2022-12-06 07:25:35,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:35,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:35,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:25:35,503 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1661342501, now seen corresponding path program 1 times [2022-12-06 07:25:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:35,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751753349] [2022-12-06 07:25:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:35,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:25:35,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751753349] [2022-12-06 07:25:35,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751753349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:35,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:35,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873308871] [2022-12-06 07:25:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:35,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:35,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1193 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:35,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:35,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:35,900 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:35,900 INFO L131 PetriNetUnfolder]: For 27017/27062 co-relation queries the response was YES. [2022-12-06 07:25:35,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14638 conditions, 2583 events. 1614/2583 cut-off events. For 27017/27062 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13804. Up to 1861 conditions per place. [2022-12-06 07:25:35,915 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:35,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1566 flow [2022-12-06 07:25:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:35,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:35,916 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1193 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:35,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1566 flow [2022-12-06 07:25:35,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:35,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:35,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:35,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:35,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:35,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:35,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,982 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:35,982 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:25:35,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:35,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:35,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:36,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:36,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:25:36,128 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:36,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:25:36,129 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash -890814460, now seen corresponding path program 1 times [2022-12-06 07:25:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159570084] [2022-12-06 07:25:36,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,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:25:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159570084] [2022-12-06 07:25:36,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159570084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459841816] [2022-12-06 07:25:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:36,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:36,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:36,545 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:36,545 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:25:36,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:36,559 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:36,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:36,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:36,560 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:36,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:36,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:36,595 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:36,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:36,595 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:36,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:36,596 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:36,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:36,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:36,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:36,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:36,622 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:36,622 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:25:36,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:36,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:36,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:36,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:36,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:25:36,780 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:36,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:36,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:36,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:25:36,780 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:36,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash 851995875, now seen corresponding path program 1 times [2022-12-06 07:25:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:36,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576484212] [2022-12-06 07:25:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:36,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:25:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:36,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576484212] [2022-12-06 07:25:36,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576484212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:36,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:36,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499084579] [2022-12-06 07:25:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:36,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:36,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:36,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:36,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:37,198 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:37,198 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:37,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:37,214 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:37,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:37,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:37,217 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:37,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:37,256 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:37,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:37,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:37,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:37,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:37,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,291 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:37,291 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:37,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:37,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:37,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:37,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:25:37,444 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:37,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:37,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:37,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:25:37,444 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1700161086, now seen corresponding path program 1 times [2022-12-06 07:25:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609351528] [2022-12-06 07:25:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:37,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:37,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:37,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609351528] [2022-12-06 07:25:37,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609351528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:37,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:37,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554466524] [2022-12-06 07:25:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:37,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:37,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:37,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:37,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:37,837 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:37,837 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:37,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:37,851 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:37,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:37,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:37,852 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:37,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:37,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:37,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:37,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:37,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:37,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:37,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:37,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:37,921 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:25:37,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:37,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:37,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:38,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:38,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 07:25:38,088 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:38,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:38,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:38,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 07:25:38,089 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash 42649249, now seen corresponding path program 1 times [2022-12-06 07:25:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:38,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359039008] [2022-12-06 07:25:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:38,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:38,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:25:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359039008] [2022-12-06 07:25:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359039008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:38,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:38,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89515501] [2022-12-06 07:25:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:38,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:38,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:38,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:38,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:38,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:38,452 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:38,452 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:38,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:38,463 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:38,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:38,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:38,464 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:38,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:38,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:38,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:38,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:38,495 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:38,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:38,495 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:38,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:38,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:38,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:38,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:38,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:38,521 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:38,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:38,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:38,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:38,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:38,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:25:38,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:38,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:38,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:38,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:25:38,678 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1785459584, now seen corresponding path program 1 times [2022-12-06 07:25:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:38,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16174800] [2022-12-06 07:25:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:38,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:25:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:38,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16174800] [2022-12-06 07:25:38,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16174800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:38,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:38,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535681364] [2022-12-06 07:25:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:38,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:38,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:38,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:38,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:38,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,049 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:39,049 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:39,064 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:39,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:39,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:39,065 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:39,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:39,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:39,110 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:39,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:39,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,111 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,137 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:39,137 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:25:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:39,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:39,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:39,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 07:25:39,316 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:25:39,317 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -766697377, now seen corresponding path program 1 times [2022-12-06 07:25:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840521368] [2022-12-06 07:25:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:39,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:25:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:39,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840521368] [2022-12-06 07:25:39,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840521368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:39,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:39,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014389220] [2022-12-06 07:25:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:39,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:39,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:39,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:39,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,715 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:39,715 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:25:39,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:39,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:39,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:39,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:39,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:39,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:39,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:39,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:39,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:39,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:39,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,764 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,789 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:39,790 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:25:39,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:39,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:39,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:39,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:39,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:25:39,938 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:39,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:39,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:39,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:25:39,938 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 976112958, now seen corresponding path program 1 times [2022-12-06 07:25:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466445955] [2022-12-06 07:25:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,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:25:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466445955] [2022-12-06 07:25:40,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466445955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:40,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:40,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501416165] [2022-12-06 07:25:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:40,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:40,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:40,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:40,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:40,300 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:40,300 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:40,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:40,313 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:40,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:40,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:40,314 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:40,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:40,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:40,350 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,350 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:40,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:40,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:40,351 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:40,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:40,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,385 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:40,385 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:40,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:40,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:40,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:40,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:25:40,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:40,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:40,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:25:40,532 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1576044003, now seen corresponding path program 1 times [2022-12-06 07:25:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966727367] [2022-12-06 07:25:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,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:25:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966727367] [2022-12-06 07:25:40,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966727367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:40,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:40,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151037890] [2022-12-06 07:25:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:40,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:40,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:40,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:40,895 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:40,895 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:40,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:40,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:40,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:40,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:40,912 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:40,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:40,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:40,953 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:40,954 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:40,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:40,954 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:40,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:40,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,981 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:40,981 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:40,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:40,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:40,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:41,137 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:41,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:25:41,138 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:41,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:41,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:41,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 07:25:41,138 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash 166766332, now seen corresponding path program 1 times [2022-12-06 07:25:41,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:41,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576772315] [2022-12-06 07:25:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:41,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:25:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:41,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576772315] [2022-12-06 07:25:41,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576772315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:41,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:41,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823608080] [2022-12-06 07:25:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:41,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:41,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:41,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:41,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:41,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:41,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:41,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:41,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:41,503 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:41,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:41,514 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:41,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:41,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:41,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:41,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:41,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:41,547 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:41,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:41,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:41,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:41,547 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:41,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:41,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:41,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:41,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:41,573 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:41,573 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:25:41,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:41,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:41,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:41,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:41,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:25:41,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:41,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:41,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:41,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:25:41,736 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1909576667, now seen corresponding path program 1 times [2022-12-06 07:25:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383604445] [2022-12-06 07:25:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:41,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:25:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:41,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383604445] [2022-12-06 07:25:41,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383604445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:41,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117158405] [2022-12-06 07:25:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:41,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:41,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:41,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:41,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:41,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:41,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,105 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:42,105 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:25:42,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:42,119 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:42,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:42,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:42,120 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:42,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:42,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:42,154 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:42,155 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:42,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,155 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,180 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:42,180 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:25:42,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:42,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:42,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:42,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:25:42,344 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:42,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 07:25:42,345 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash -642580294, now seen corresponding path program 1 times [2022-12-06 07:25:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206804278] [2022-12-06 07:25:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:42,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:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206804278] [2022-12-06 07:25:42,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206804278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:42,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96864348] [2022-12-06 07:25:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:42,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:42,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:42,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:42,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:42,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,696 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:42,696 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:42,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:42,709 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:42,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:42,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:42,710 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:42,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:42,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:42,743 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:42,744 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:42,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:42,745 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:42,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:42,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,770 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:42,771 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:25:42,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:42,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:42,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:42,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:42,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:25:42,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:42,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:42,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:42,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 07:25:42,913 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1100230041, now seen corresponding path program 1 times [2022-12-06 07:25:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916223805] [2022-12-06 07:25:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:42,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:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:42,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916223805] [2022-12-06 07:25:42,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916223805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:42,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:42,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761834251] [2022-12-06 07:25:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:42,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:42,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:42,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:42,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:42,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:42,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:43,265 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:43,265 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:43,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:43,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:43,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:43,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:43,279 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:43,312 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:43,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:43,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,313 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,343 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:43,343 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:25:43,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:43,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:43,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:43,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:25:43,500 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:43,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:43,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:43,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 07:25:43,500 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1451926920, now seen corresponding path program 1 times [2022-12-06 07:25:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:43,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094646398] [2022-12-06 07:25:43,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:43,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:25:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:43,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094646398] [2022-12-06 07:25:43,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094646398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:43,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:43,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008624859] [2022-12-06 07:25:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:43,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:43,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:43,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:43,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:43,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:43,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:43,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:43,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:43,844 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:43,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:43,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:43,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:43,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:43,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:43,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:43,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:43,895 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:43,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:43,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,895 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:43,921 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:25:43,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:43,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:43,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:44,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:44,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:25:44,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:44,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 07:25:44,071 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 290883415, now seen corresponding path program 1 times [2022-12-06 07:25:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696343771] [2022-12-06 07:25:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,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:25:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696343771] [2022-12-06 07:25:44,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696343771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:44,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:44,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837083686] [2022-12-06 07:25:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:44,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:44,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,414 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:44,414 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:44,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:44,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:44,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:44,426 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:44,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:44,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:44,458 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:44,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:44,458 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:44,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:44,458 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:44,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:44,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:44,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:44,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:44,483 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:44,484 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:44,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:44,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:44,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:44,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:44,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:25:44,642 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:44,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 07:25:44,642 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2033693750, now seen corresponding path program 1 times [2022-12-06 07:25:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157424113] [2022-12-06 07:25:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157424113] [2022-12-06 07:25:44,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157424113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:44,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:44,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877705895] [2022-12-06 07:25:44,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:44,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:44,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:44,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:44,992 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:44,992 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:25:44,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13534 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:45,006 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:45,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:45,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:45,008 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:45,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:45,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:45,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:45,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:45,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:45,043 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:45,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:45,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,068 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:45,068 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:25:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:45,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:45,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:45,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:25:45,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:45,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:45,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:45,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:25:45,235 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -518463211, now seen corresponding path program 1 times [2022-12-06 07:25:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983007882] [2022-12-06 07:25:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:45,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:25:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983007882] [2022-12-06 07:25:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983007882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334593483] [2022-12-06 07:25:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:45,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:45,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:45,615 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:45,615 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:25:45,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13561 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:45,632 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:45,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:45,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:45,633 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:45,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:45,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:45,666 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:45,667 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:45,667 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:45,667 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:45,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:45,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,692 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:45,692 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:25:45,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:45,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:45,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:45,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:45,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:25:45,839 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:45,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:45,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:45,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:25:45,840 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1224347124, now seen corresponding path program 1 times [2022-12-06 07:25:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:45,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740228787] [2022-12-06 07:25:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:45,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:25:45,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740228787] [2022-12-06 07:25:45,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740228787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:45,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:45,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717435051] [2022-12-06 07:25:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:45,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:45,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:45,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:45,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:45,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:45,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,191 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:46,191 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:46,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13539 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:46,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:46,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:46,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:46,206 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:46,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:46,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,265 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:46,265 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:46,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,265 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,291 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:46,291 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:25:46,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:46,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:46,437 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:46,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:25:46,438 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:46,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:46,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:46,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:25:46,438 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1327809837, now seen corresponding path program 1 times [2022-12-06 07:25:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:46,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597911301] [2022-12-06 07:25:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:46,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597911301] [2022-12-06 07:25:46,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597911301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:46,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108181242] [2022-12-06 07:25:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:46,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:46,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:46,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:46,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,817 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:46,817 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:46,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:46,830 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:46,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:46,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:46,831 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:46,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:46,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:46,869 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:46,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:46,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:46,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:46,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:46,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,896 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:46,896 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:25:46,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:46,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:46,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:47,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:25:47,041 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:47,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:25:47,042 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash 415000498, now seen corresponding path program 1 times [2022-12-06 07:25:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772553666] [2022-12-06 07:25:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:47,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:25:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772553666] [2022-12-06 07:25:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772553666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:47,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:47,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783580568] [2022-12-06 07:25:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:47,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:47,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:47,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:47,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:47,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:47,416 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:47,417 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:47,432 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:47,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:47,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:47,433 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:47,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:47,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:47,470 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:47,470 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:47,471 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:47,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:47,471 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:47,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:47,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:47,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:47,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:47,502 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:47,503 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:25:47,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:47,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:47,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:47,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:47,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:25:47,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:47,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:47,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:47,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 07:25:47,662 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2137156463, now seen corresponding path program 1 times [2022-12-06 07:25:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:47,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9715897] [2022-12-06 07:25:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:47,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:25:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9715897] [2022-12-06 07:25:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9715897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:47,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664664834] [2022-12-06 07:25:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:47,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:47,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:47,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:47,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,011 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:48,011 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:25:48,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:48,025 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:48,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:48,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:48,026 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:48,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:48,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,065 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:48,065 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:48,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,066 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,094 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:48,094 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:48,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:48,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:48,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:48,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:25:48,231 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:48,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:25:48,232 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -394346128, now seen corresponding path program 1 times [2022-12-06 07:25:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568699557] [2022-12-06 07:25:48,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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:25:48,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568699557] [2022-12-06 07:25:48,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568699557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928400382] [2022-12-06 07:25:48,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:48,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:48,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:48,576 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:48,576 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:25:48,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:48,588 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:48,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:48,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:48,589 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:48,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:48,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:48,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:48,622 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:48,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,622 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,648 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:48,648 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:25:48,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:48,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:48,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:48,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:48,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:25:48,797 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:48,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:25:48,797 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:48,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1348464207, now seen corresponding path program 1 times [2022-12-06 07:25:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234181487] [2022-12-06 07:25:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:48,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:25:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234181487] [2022-12-06 07:25:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234181487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:48,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:48,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027586252] [2022-12-06 07:25:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:48,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:48,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:48,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:48,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:49,144 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:49,144 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:49,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:49,157 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:49,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:49,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:49,159 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:49,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:49,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:49,191 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:49,192 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:49,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,192 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,217 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:49,218 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:25:49,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:49,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:49,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:25:49,352 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:49,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 07:25:49,353 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1203692754, now seen corresponding path program 1 times [2022-12-06 07:25:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635696407] [2022-12-06 07:25:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,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:25:49,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:49,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635696407] [2022-12-06 07:25:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635696407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:49,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455153874] [2022-12-06 07:25:49,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:49,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:49,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:49,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:49,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:49,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:49,705 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:49,705 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:25:49,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:49,718 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:49,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:49,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:49,719 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:49,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:49,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:49,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:49,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:49,751 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:49,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:49,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,777 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:49,777 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:25:49,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:49,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:49,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:49,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:49,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:25:49,940 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:49,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:49,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:49,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 07:25:49,940 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash 539117581, now seen corresponding path program 1 times [2022-12-06 07:25:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:49,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210689008] [2022-12-06 07:25:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210689008] [2022-12-06 07:25:50,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210689008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889701417] [2022-12-06 07:25:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:50,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:50,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:50,292 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:50,293 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13513 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:50,306 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:50,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:50,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:50,307 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:50,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:50,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:50,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:50,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:50,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:50,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,344 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:50,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:50,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,368 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:50,369 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:25:50,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:50,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:50,503 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:50,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:25:50,504 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:50,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:50,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 07:25:50,504 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2013039380, now seen corresponding path program 1 times [2022-12-06 07:25:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625822732] [2022-12-06 07:25:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:50,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:25:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:50,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625822732] [2022-12-06 07:25:50,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625822732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:50,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106709808] [2022-12-06 07:25:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:50,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:50,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:50,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:50,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:50,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:50,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:50,853 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:50,853 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:50,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:50,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:50,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:50,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:50,867 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:50,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:50,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:50,899 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:50,899 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:50,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:50,899 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:50,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:50,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,927 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:50,927 INFO L131 PetriNetUnfolder]: For 3175/3318 co-relation queries the response was YES. [2022-12-06 07:25:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3175/3318 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:50,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:50,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:51,065 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:51,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:25:51,065 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:51,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:51,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:51,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 07:25:51,066 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -270229045, now seen corresponding path program 1 times [2022-12-06 07:25:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962392815] [2022-12-06 07:25:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:51,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962392815] [2022-12-06 07:25:51,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962392815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:51,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:51,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101160441] [2022-12-06 07:25:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:51,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:51,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:51,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:51,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:51,410 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:51,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:51,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:51,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:51,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:51,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:51,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:51,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:51,463 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:51,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:51,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:51,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:51,464 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:51,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:51,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:51,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:51,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:51,490 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:51,491 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:25:51,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:51,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:51,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:51,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:51,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:25:51,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:51,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:51,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:51,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 07:25:51,643 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:51,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1472581290, now seen corresponding path program 1 times [2022-12-06 07:25:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:51,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457298899] [2022-12-06 07:25:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:51,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:25:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:51,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457298899] [2022-12-06 07:25:51,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457298899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:51,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:51,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155430434] [2022-12-06 07:25:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:51,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:51,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:51,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:51,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,057 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:52,057 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:52,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:52,069 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:52,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:52,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:52,070 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:52,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:52,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:52,102 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:52,103 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:52,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:52,103 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:52,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:52,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,128 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:52,128 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:25:52,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:52,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:52,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:25:52,263 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:52,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:25:52,264 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1079575671, now seen corresponding path program 1 times [2022-12-06 07:25:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702018496] [2022-12-06 07:25:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:52,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:25:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702018496] [2022-12-06 07:25:52,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702018496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:52,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903355955] [2022-12-06 07:25:52,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,326 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=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:52,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:52,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:52,613 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:52,613 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:52,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:52,627 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:52,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:52,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:52,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:52,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:52,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:52,664 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:52,664 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:52,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:52,664 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:52,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:52,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:52,691 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:25:52,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:52,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:52,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:52,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:52,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:25:52,841 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:52,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:52,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:52,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 07:25:52,842 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 663234664, now seen corresponding path program 1 times [2022-12-06 07:25:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:52,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40328536] [2022-12-06 07:25:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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:25:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:52,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40328536] [2022-12-06 07:25:52,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40328536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:52,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:52,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:52,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744116323] [2022-12-06 07:25:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:52,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:52,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:52,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:52,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:52,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,197 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:53,197 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:25:53,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:53,210 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:53,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:53,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:53,211 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:53,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,246 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:53,246 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:53,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,246 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,276 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:53,276 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:25:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:53,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:53,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:53,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:25:53,424 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:53,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:53,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:53,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 07:25:53,424 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1888922297, now seen corresponding path program 1 times [2022-12-06 07:25:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:53,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352818958] [2022-12-06 07:25:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:53,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:25:53,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352818958] [2022-12-06 07:25:53,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352818958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:53,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:53,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403196139] [2022-12-06 07:25:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:53,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:53,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:53,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:53,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:53,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:53,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:53,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:53,803 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:53,803 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:53,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:53,817 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:53,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:53,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:53,818 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:53,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:53,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:53,854 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:53,855 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:53,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:53,855 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,855 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:53,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:53,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,881 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:53,881 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:53,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:53,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:53,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:54,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:54,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:25:54,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:54,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:54,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:54,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 07:25:54,037 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -146111962, now seen corresponding path program 1 times [2022-12-06 07:25:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:54,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879273122] [2022-12-06 07:25:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:54,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:25:54,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879273122] [2022-12-06 07:25:54,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879273122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:54,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:54,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793284662] [2022-12-06 07:25:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:54,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:54,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:54,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:54,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:54,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:54,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:54,445 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:54,445 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:25:54,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:54,459 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:54,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:54,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:54,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:54,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:54,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:54,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:54,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:54,495 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:54,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:54,495 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:54,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:54,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:54,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:54,521 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:54,522 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:25:54,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:54,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:54,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:54,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:54,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:25:54,672 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:54,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:54,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:54,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 07:25:54,673 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:54,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1596698373, now seen corresponding path program 1 times [2022-12-06 07:25:54,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:54,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435841753] [2022-12-06 07:25:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:54,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:54,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:54,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435841753] [2022-12-06 07:25:54,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435841753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:54,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127778022] [2022-12-06 07:25:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:54,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:54,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:54,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:54,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:54,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,004 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:55,005 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:25:55,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:55,018 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:55,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:55,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:55,019 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:55,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:55,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:55,052 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:55,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,052 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,078 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:55,078 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:25:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:55,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:55,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:55,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:25:55,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:55,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:55,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 07:25:55,242 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash -955458588, now seen corresponding path program 1 times [2022-12-06 07:25:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:55,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208391217] [2022-12-06 07:25:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:55,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:25:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208391217] [2022-12-06 07:25:55,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208391217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346160654] [2022-12-06 07:25:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:55,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:55,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:55,603 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:55,603 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:25:55,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:55,617 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:55,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:55,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:55,618 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:55,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:55,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:55,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:55,657 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:55,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:55,657 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:55,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:55,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,682 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:55,683 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:25:55,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:55,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:55,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:55,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:55,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:25:55,834 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:55,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:55,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:55,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 07:25:55,835 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 787351747, now seen corresponding path program 1 times [2022-12-06 07:25:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:55,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697960255] [2022-12-06 07:25:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:55,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:25:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:55,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697960255] [2022-12-06 07:25:55,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697960255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:55,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:55,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630767686] [2022-12-06 07:25:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:55,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:55,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:55,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:55,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:55,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:55,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:56,191 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:56,191 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:56,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:56,204 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:56,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:56,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:56,205 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:56,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:56,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:56,240 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:56,240 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:56,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,240 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,266 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:56,266 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:25:56,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:56,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:56,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:25:56,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:56,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 07:25:56,415 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1764805214, now seen corresponding path program 1 times [2022-12-06 07:25:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206196167] [2022-12-06 07:25:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:56,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206196167] [2022-12-06 07:25:56,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206196167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:56,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:56,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653600033] [2022-12-06 07:25:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:56,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:56,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:56,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:56,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:56,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:56,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:56,767 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:56,768 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:56,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:56,781 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:56,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:56,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:56,782 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:56,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:56,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:56,818 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:56,818 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:56,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:56,818 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:56,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:56,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,844 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:56,844 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:25:56,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:56,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:56,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:56,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:56,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:25:56,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:56,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:56,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:56,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 07:25:56,988 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -21994879, now seen corresponding path program 1 times [2022-12-06 07:25:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:56,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319296266] [2022-12-06 07:25:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:56,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,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:25:57,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319296266] [2022-12-06 07:25:57,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319296266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610833818] [2022-12-06 07:25:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:57,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:57,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,359 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:57,360 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:25:57,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:57,372 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:57,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:57,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:57,373 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:57,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,408 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:57,408 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:57,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,408 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,435 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:57,435 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:25:57,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:57,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:57,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:57,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 07:25:57,603 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:57,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:57,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 07:25:57,603 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1720815456, now seen corresponding path program 1 times [2022-12-06 07:25:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:57,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317391723] [2022-12-06 07:25:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:57,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:25:57,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:57,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317391723] [2022-12-06 07:25:57,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317391723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:57,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:57,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396903283] [2022-12-06 07:25:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:57,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:57,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:57,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:57,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:57,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:57,936 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:57,936 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:57,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:57,950 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:57,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:57,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:57,951 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:57,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:57,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:57,987 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:57,987 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:57,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:57,987 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:57,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:57,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:57,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,013 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:58,014 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:25:58,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:58,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:58,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:25:58,156 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:58,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 07:25:58,157 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash -831341505, now seen corresponding path program 1 times [2022-12-06 07:25:58,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414442122] [2022-12-06 07:25:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25: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:25:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414442122] [2022-12-06 07:25:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414442122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730340553] [2022-12-06 07:25:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:58,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:58,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:58,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:58,493 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:25:58,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13541 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:58,508 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:58,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:58,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:58,509 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:58,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:58,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:58,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:58,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:58,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:58,550 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:58,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:58,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,576 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:25:58,576 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:25:58,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:25:58,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:58,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:58,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:58,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:25:58,715 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:58,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:58,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:58,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 07:25:58,716 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 911468830, now seen corresponding path program 1 times [2022-12-06 07:25:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242861107] [2022-12-06 07:25:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:58,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:25:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242861107] [2022-12-06 07:25:58,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242861107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:58,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:58,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881764356] [2022-12-06 07:25:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:58,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:58,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:58,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:58,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:58,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,066 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:59,066 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:25:59,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:59,080 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:59,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:59,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:59,080 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:59,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:59,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,115 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:59,116 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:59,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,116 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,142 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:59,142 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:25:59,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:59,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:59,304 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:25:59,305 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:59,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 07:25:59,305 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1640688131, now seen corresponding path program 1 times [2022-12-06 07:25:59,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134250508] [2022-12-06 07:25:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:59,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134250508] [2022-12-06 07:25:59,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134250508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:59,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:59,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557408127] [2022-12-06 07:25:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:59,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:59,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:59,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:59,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:59,646 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:25:59,647 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:25:59,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13504 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:25:59,661 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:25:59,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:25:59,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:25:59,662 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:25:59,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:25:59,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:59,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:25:59,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:25:59,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:59,700 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:59,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:59,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,726 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:25:59,726 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:25:59,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:25:59,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:25:59,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:25:59,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:25:59,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 07:25:59,902 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:25:59,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:59,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:59,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 07:25:59,903 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:25:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 102122204, now seen corresponding path program 1 times [2022-12-06 07:25:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:59,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080423585] [2022-12-06 07:25:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:59,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:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:59,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080423585] [2022-12-06 07:25:59,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080423585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:59,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:59,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723856385] [2022-12-06 07:25:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:59,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:59,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:25:59,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:59,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:25:59,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,264 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:00,264 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:00,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:00,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:00,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:00,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:00,279 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:00,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:00,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,315 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:00,315 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:00,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,315 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,342 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:00,342 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:26:00,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:00,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:00,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:00,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:26:00,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:00,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:00,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 07:26:00,493 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1844932539, now seen corresponding path program 1 times [2022-12-06 07:26:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:00,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671287943] [2022-12-06 07:26:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:00,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:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:00,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671287943] [2022-12-06 07:26:00,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671287943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:00,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:00,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:00,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623722957] [2022-12-06 07:26:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:00,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:00,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:00,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:00,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:00,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:00,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:00,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:00,835 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:00,835 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:00,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:00,850 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:00,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:00,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:00,851 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:00,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:00,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:00,889 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:00,890 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:00,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:00,890 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:00,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:00,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,916 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:00,916 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:00,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2962 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:00,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:00,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:01,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:01,055 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:01,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 07:26:01,055 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -707224422, now seen corresponding path program 1 times [2022-12-06 07:26:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802805509] [2022-12-06 07:26:01,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802805509] [2022-12-06 07:26:01,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802805509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107775807] [2022-12-06 07:26:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:01,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:01,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:01,401 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:01,402 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:01,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:01,417 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:01,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:01,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:01,418 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:01,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:01,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:01,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:01,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:01,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:01,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:01,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:01,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:01,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:01,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:01,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:01,482 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:01,482 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:01,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:01,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:01,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:01,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:01,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:26:01,640 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:01,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:01,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:01,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 07:26:01,640 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:01,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1035585913, now seen corresponding path program 1 times [2022-12-06 07:26:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:01,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446132550] [2022-12-06 07:26:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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:26:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:01,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446132550] [2022-12-06 07:26:01,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446132550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:01,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:01,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047036933] [2022-12-06 07:26:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:01,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:01,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:01,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:01,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:01,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,025 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:02,026 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:02,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:02,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:02,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:02,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:02,041 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:02,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:02,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,077 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:02,077 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:02,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:02,077 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,103 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:02,103 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:02,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:02,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:02,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:02,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:02,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 07:26:02,243 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1516571048, now seen corresponding path program 1 times [2022-12-06 07:26:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122951136] [2022-12-06 07:26:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,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:26:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122951136] [2022-12-06 07:26:02,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122951136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:02,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:02,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720063824] [2022-12-06 07:26:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:02,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:02,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:02,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:02,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:02,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:02,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:02,599 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:02,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13550 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:02,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:02,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:02,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:02,615 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:02,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:02,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:02,653 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:02,654 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:02,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:02,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,681 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:02,682 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:26:02,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:02,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:02,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:02,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:02,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:02,824 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:02,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:02,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 07:26:02,824 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 226239287, now seen corresponding path program 1 times [2022-12-06 07:26:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:02,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122472035] [2022-12-06 07:26:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:02,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:26:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:02,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122472035] [2022-12-06 07:26:02,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122472035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:02,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:02,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815457674] [2022-12-06 07:26:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:02,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:02,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:02,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:02,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:02,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:02,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:03,210 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:26:03,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13527 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:03,225 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:03,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:03,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:03,226 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:03,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:03,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:03,263 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:03,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,290 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:03,290 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:26:03,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:03,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:03,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:03,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 07:26:03,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:03,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:03,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:03,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 07:26:03,497 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1969049622, now seen corresponding path program 1 times [2022-12-06 07:26:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:03,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227036260] [2022-12-06 07:26:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:03,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:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:03,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227036260] [2022-12-06 07:26:03,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227036260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:03,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:03,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437513738] [2022-12-06 07:26:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:03,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:03,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:03,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:03,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:03,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:03,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:03,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:03,857 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:03,857 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:26:03,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13507 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:03,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:03,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:03,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:03,872 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:03,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:03,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:03,913 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:03,913 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:03,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:03,913 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:03,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:03,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,938 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:03,938 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:26:03,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3018 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:03,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:03,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:04,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:04,083 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:04,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 07:26:04,083 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -583107339, now seen corresponding path program 1 times [2022-12-06 07:26:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143389846] [2022-12-06 07:26:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143389846] [2022-12-06 07:26:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143389846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399080197] [2022-12-06 07:26:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:04,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:04,424 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:04,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:04,439 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:04,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:04,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:04,440 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:04,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:04,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:04,478 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:04,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:04,479 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:04,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:04,479 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:04,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:04,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:04,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:04,506 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:04,507 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:04,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:04,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:04,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:04,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:04,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:26:04,648 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:04,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:04,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:04,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 07:26:04,649 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1159702996, now seen corresponding path program 1 times [2022-12-06 07:26:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:04,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136150543] [2022-12-06 07:26:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:04,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:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:04,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136150543] [2022-12-06 07:26:04,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136150543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:04,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:04,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521325213] [2022-12-06 07:26:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:04,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:04,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:04,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:04,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:04,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:04,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:04,996 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:04,997 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:05,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:05,011 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:05,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:05,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:05,012 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:05,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:05,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,047 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:05,048 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:05,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,048 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,073 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:05,073 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:26:05,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:05,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:05,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:26:05,224 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:05,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 07:26:05,224 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1392453965, now seen corresponding path program 1 times [2022-12-06 07:26:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425629506] [2022-12-06 07:26:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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:26:05,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425629506] [2022-12-06 07:26:05,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425629506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037159174] [2022-12-06 07:26:05,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:05,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:05,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:05,594 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:05,594 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:05,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:05,610 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:05,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:05,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:05,611 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:05,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:05,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:05,649 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:05,650 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:05,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:05,650 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:05,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:05,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,676 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:05,676 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:26:05,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:05,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:05,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:05,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:05,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:05,820 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:05,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:05,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:05,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 07:26:05,820 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 350356370, now seen corresponding path program 1 times [2022-12-06 07:26:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:05,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290102629] [2022-12-06 07:26:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:05,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:26:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290102629] [2022-12-06 07:26:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290102629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:05,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:05,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144117379] [2022-12-06 07:26:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:05,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:05,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:05,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:05,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:05,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:05,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,183 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:06,183 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:06,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:06,197 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:06,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:06,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:06,198 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:06,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:06,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:06,233 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:06,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,233 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,259 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:06,260 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:26:06,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:06,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:06,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:06,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:26:06,405 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:06,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:06,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:06,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 07:26:06,405 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2093166705, now seen corresponding path program 1 times [2022-12-06 07:26:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:06,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853600626] [2022-12-06 07:26:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:06,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:26:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:06,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853600626] [2022-12-06 07:26:06,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853600626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:06,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:06,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931775588] [2022-12-06 07:26:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:06,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:06,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:06,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:06,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:06,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:06,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:06,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:06,742 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:06,742 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:06,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:06,758 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:06,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:06,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:06,759 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:06,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:06,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:06,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:06,793 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:06,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:06,793 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:06,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:06,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,818 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:06,818 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:06,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:06,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:06,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:06,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:06,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:26:06,984 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:06,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:06,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:06,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 07:26:06,984 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -458990256, now seen corresponding path program 1 times [2022-12-06 07:26:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:06,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9597537] [2022-12-06 07:26:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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:26:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9597537] [2022-12-06 07:26:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9597537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133863651] [2022-12-06 07:26:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:07,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:07,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:07,318 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:07,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:07,331 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:07,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:07,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:07,332 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:07,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:07,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,367 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:07,368 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:07,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,368 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,396 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:07,396 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:26:07,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:07,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:07,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:07,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:26:07,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:07,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:07,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:07,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 07:26:07,552 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1283820079, now seen corresponding path program 1 times [2022-12-06 07:26:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:07,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562733223] [2022-12-06 07:26:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:07,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:26:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:07,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562733223] [2022-12-06 07:26:07,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562733223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:07,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:07,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525951045] [2022-12-06 07:26:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:07,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:07,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:07,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:07,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:07,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:07,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:07,918 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:07,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:07,932 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:07,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:07,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:07,933 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:07,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:07,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:07,971 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:07,972 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:07,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:07,972 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:07,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:07,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:07,998 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:07,998 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:07,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:08,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:08,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:08,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:26:08,155 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:08,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 07:26:08,155 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1268336882, now seen corresponding path program 1 times [2022-12-06 07:26:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953185159] [2022-12-06 07:26:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:08,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:26:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953185159] [2022-12-06 07:26:08,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953185159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:08,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090799036] [2022-12-06 07:26:08,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:08,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:08,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:08,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:08,536 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:08,536 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:08,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:08,550 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:08,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:08,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:08,551 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:08,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:08,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:08,587 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:08,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:08,588 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:08,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:08,588 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:08,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:08,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:08,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:08,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:08,613 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:08,613 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:08,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:08,616 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:08,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:08,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:08,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:26:08,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:08,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:08,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 07:26:08,755 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash 474473453, now seen corresponding path program 1 times [2022-12-06 07:26:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:08,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661306127] [2022-12-06 07:26:08,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:08,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:26:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661306127] [2022-12-06 07:26:08,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661306127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:08,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:08,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528890668] [2022-12-06 07:26:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:08,812 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,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:08,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:08,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:08,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:08,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:08,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,084 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:09,085 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:09,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:09,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:09,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:09,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:09,100 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:09,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:09,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:09,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:09,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,137 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,164 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:09,164 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:09,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:09,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:09,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:26:09,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:09,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-06 07:26:09,321 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2077683508, now seen corresponding path program 1 times [2022-12-06 07:26:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78291003] [2022-12-06 07:26:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,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:26:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78291003] [2022-12-06 07:26:09,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78291003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297020723] [2022-12-06 07:26:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:09,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:09,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:09,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:09,691 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:09,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:09,704 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:09,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:09,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:09,705 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:09,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:09,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:09,741 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:09,741 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:09,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,741 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,767 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:09,767 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:26:09,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:09,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:09,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:09,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:09,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:26:09,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:09,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:09,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 07:26:09,914 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -334873173, now seen corresponding path program 1 times [2022-12-06 07:26:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429514294] [2022-12-06 07:26:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:09,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:26:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:09,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429514294] [2022-12-06 07:26:09,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429514294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:09,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771797595] [2022-12-06 07:26:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:09,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:09,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:09,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:09,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:09,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:09,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,246 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:10,247 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:10,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:10,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:10,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:10,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:10,262 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:10,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:10,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:10,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:10,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,299 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,325 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:10,325 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:26:10,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:10,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:10,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:10,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:26:10,474 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:10,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,474 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 07:26:10,474 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1407937162, now seen corresponding path program 1 times [2022-12-06 07:26:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:10,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071753858] [2022-12-06 07:26:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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:26:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:10,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071753858] [2022-12-06 07:26:10,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071753858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:10,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:10,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832763785] [2022-12-06 07:26:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:10,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:10,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:10,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:10,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:10,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:10,864 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:10,865 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:10,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:10,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:10,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:10,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:10,881 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:10,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:10,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:10,921 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:10,922 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:10,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:10,922 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:10,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:10,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,948 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:10,949 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:26:10,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:10,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:10,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:11,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:26:11,091 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:11,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 07:26:11,092 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1144219799, now seen corresponding path program 1 times [2022-12-06 07:26:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98654610] [2022-12-06 07:26:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,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:26:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98654610] [2022-12-06 07:26:11,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98654610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55087989] [2022-12-06 07:26:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:11,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:11,431 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:11,431 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:26:11,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13531 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:11,446 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:11,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:11,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:11,447 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:11,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:11,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:11,485 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:11,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:11,485 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:11,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:11,486 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:11,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:11,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:11,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:11,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:11,512 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:11,512 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:26:11,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:11,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:11,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:11,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:11,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:26:11,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:11,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:11,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:11,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 07:26:11,664 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash 598590536, now seen corresponding path program 1 times [2022-12-06 07:26:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642040736] [2022-12-06 07:26:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,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:26:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642040736] [2022-12-06 07:26:11,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642040736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:11,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:11,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230479808] [2022-12-06 07:26:11,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:11,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:11,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:11,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,047 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:12,047 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:12,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:12,063 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:12,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:12,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:12,065 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:12,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:12,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,106 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:12,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:12,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,133 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:12,133 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:26:12,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:12,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:12,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:26:12,275 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:12,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 07:26:12,276 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1953566425, now seen corresponding path program 1 times [2022-12-06 07:26:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353283813] [2022-12-06 07:26:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,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:26:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353283813] [2022-12-06 07:26:12,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353283813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654337957] [2022-12-06 07:26:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:12,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:12,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:12,627 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:12,627 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:12,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:12,641 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:12,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:12,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:12,642 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:12,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:12,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:12,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:12,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:12,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:12,682 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:12,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:12,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,708 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:12,709 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:26:12,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:12,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:12,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:12,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:12,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:26:12,867 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:12,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:12,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:12,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-06 07:26:12,867 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash -210756090, now seen corresponding path program 1 times [2022-12-06 07:26:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:12,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974053309] [2022-12-06 07:26:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:12,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:12,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:26:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:12,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974053309] [2022-12-06 07:26:12,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974053309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:12,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:12,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596132560] [2022-12-06 07:26:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:12,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:12,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:12,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:12,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:12,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,221 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:13,222 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:13,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:13,235 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:13,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:13,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:13,236 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:13,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:13,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:13,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:13,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,300 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:13,300 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:13,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:13,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:13,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:26:13,436 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:13,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-06 07:26:13,437 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1532054245, now seen corresponding path program 1 times [2022-12-06 07:26:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430895078] [2022-12-06 07:26:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:13,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:26:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:13,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430895078] [2022-12-06 07:26:13,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430895078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:13,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:13,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982309046] [2022-12-06 07:26:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:13,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:13,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:13,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:13,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:13,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:13,772 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:13,772 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:13,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:13,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:13,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:13,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:13,787 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:13,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:13,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:13,822 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:13,822 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:13,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:13,822 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:13,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:13,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,848 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:13,848 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:13,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:13,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:13,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:13,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:13,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:26:13,985 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:13,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:13,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-06 07:26:13,986 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1020102716, now seen corresponding path program 1 times [2022-12-06 07:26:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:13,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228879649] [2022-12-06 07:26:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228879649] [2022-12-06 07:26:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228879649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134723450] [2022-12-06 07:26:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:14,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:14,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,342 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:14,343 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:14,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:14,356 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:14,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:14,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:14,357 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:14,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:14,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:14,392 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:14,393 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:14,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:14,393 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:14,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:14,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,418 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:14,418 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:26:14,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:14,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:14,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:14,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:26:14,580 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:14,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:14,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:14,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-06 07:26:14,580 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash 722707619, now seen corresponding path program 1 times [2022-12-06 07:26:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997275715] [2022-12-06 07:26:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:14,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:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:14,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997275715] [2022-12-06 07:26:14,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997275715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:14,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:14,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:14,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435659416] [2022-12-06 07:26:14,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:14,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:14,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:14,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:14,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:14,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:14,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:14,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:14,928 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:14,928 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:26:14,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:14,942 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:14,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:14,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:14,943 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:14,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:14,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:14,983 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:14,983 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:14,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:14,983 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:14,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:14,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:14,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,009 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:15,009 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:15,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:15,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:15,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:26:15,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:15,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-06 07:26:15,158 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1829449342, now seen corresponding path program 1 times [2022-12-06 07:26:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15754896] [2022-12-06 07:26:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,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:26:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15754896] [2022-12-06 07:26:15,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15754896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598699856] [2022-12-06 07:26:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:15,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:15,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:15,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:15,524 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:15,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:15,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:15,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:15,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:15,541 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:15,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:15,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:15,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:15,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:15,579 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:15,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:15,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,606 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:15,606 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:26:15,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:15,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:15,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:15,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:15,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:26:15,762 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:15,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:15,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:15,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-06 07:26:15,762 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -86639007, now seen corresponding path program 1 times [2022-12-06 07:26:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:15,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686732645] [2022-12-06 07:26:15,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686732645] [2022-12-06 07:26:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686732645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840267469] [2022-12-06 07:26:15,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:15,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:15,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:15,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:15,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,133 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:16,134 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:16,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13547 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:16,149 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:16,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:16,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:16,150 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:16,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:16,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,190 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:16,190 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:16,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,190 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,217 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:16,217 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:26:16,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:16,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:16,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:26:16,370 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:16,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 07:26:16,371 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:16,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1656171328, now seen corresponding path program 1 times [2022-12-06 07:26:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181247696] [2022-12-06 07:26:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:16,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:26:16,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181247696] [2022-12-06 07:26:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181247696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:16,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882862310] [2022-12-06 07:26:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:16,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:16,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:16,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:16,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:16,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:16,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:16,755 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:16,755 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:16,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:16,772 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:16,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:16,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:16,773 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:16,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:16,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:16,810 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:16,810 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:16,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:16,810 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:16,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:16,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,838 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:16,838 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:26:16,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:16,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:16,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:16,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:16,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:26:16,979 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:16,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:16,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:16,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-06 07:26:16,979 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash -895985633, now seen corresponding path program 1 times [2022-12-06 07:26:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:16,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594277985] [2022-12-06 07:26:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:17,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:26:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594277985] [2022-12-06 07:26:17,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594277985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115792359] [2022-12-06 07:26:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:17,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:17,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,339 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:17,339 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:17,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:17,354 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:17,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:17,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:17,355 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:17,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:17,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:17,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:17,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,396 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,423 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:17,423 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:26:17,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:17,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:17,561 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:17,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:26:17,562 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:17,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:17,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:17,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-06 07:26:17,562 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash 846824702, now seen corresponding path program 1 times [2022-12-06 07:26:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:17,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605426655] [2022-12-06 07:26:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:17,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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:26:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:17,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605426655] [2022-12-06 07:26:17,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605426655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:17,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:17,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867415474] [2022-12-06 07:26:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:17,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:17,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:17,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:17,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,908 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:17,909 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:26:17,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:17,921 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:17,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:17,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:17,922 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:17,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:17,956 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:17,956 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:17,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:17,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:17,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:17,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,981 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:17,981 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:26:17,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:17,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:17,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:18,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:18,121 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:18,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-06 07:26:18,121 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1705332259, now seen corresponding path program 1 times [2022-12-06 07:26:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935831642] [2022-12-06 07:26:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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:26:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935831642] [2022-12-06 07:26:18,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935831642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49092357] [2022-12-06 07:26:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:18,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:18,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:18,475 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:18,475 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:26:18,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:18,490 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:18,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:18,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:18,491 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:18,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:18,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:18,527 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:18,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:18,527 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:18,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:18,527 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:18,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:18,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:18,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:18,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:18,553 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:18,553 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:18,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:18,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:18,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:18,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:18,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:26:18,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:18,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:18,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:18,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-06 07:26:18,709 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 37478076, now seen corresponding path program 1 times [2022-12-06 07:26:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:18,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856212944] [2022-12-06 07:26:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:18,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:26:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:18,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856212944] [2022-12-06 07:26:18,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856212944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:18,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:18,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796751611] [2022-12-06 07:26:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:18,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:18,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:18,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:18,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,076 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:19,077 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:19,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:19,090 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:19,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:19,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:19,091 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:19,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:19,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,127 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:19,128 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:19,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,128 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,153 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:19,153 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:26:19,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:19,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:19,304 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:26:19,305 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:19,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-06 07:26:19,305 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1780288411, now seen corresponding path program 1 times [2022-12-06 07:26:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681324795] [2022-12-06 07:26:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,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:26:19,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681324795] [2022-12-06 07:26:19,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681324795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:19,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745982144] [2022-12-06 07:26:19,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:19,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:19,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:19,672 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:19,672 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:19,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:19,687 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:19,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:19,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:19,688 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:19,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:19,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:19,727 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:19,727 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:19,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:19,727 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:19,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:19,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,754 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:19,754 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:19,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:19,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:19,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:19,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:19,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:26:19,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:19,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:19,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:19,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 07:26:19,920 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash -771868550, now seen corresponding path program 1 times [2022-12-06 07:26:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:19,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458389546] [2022-12-06 07:26:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:19,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:19,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458389546] [2022-12-06 07:26:19,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458389546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:19,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:19,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:19,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566440671] [2022-12-06 07:26:19,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:19,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:19,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:19,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:19,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:19,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:19,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,278 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:20,279 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:20,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:20,293 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:20,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:20,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:20,293 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:20,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:20,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,328 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:20,328 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:20,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,328 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,354 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:20,354 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:20,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:20,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:20,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:20,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:26:20,503 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:20,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:20,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:20,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-06 07:26:20,503 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 970941785, now seen corresponding path program 1 times [2022-12-06 07:26:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489776281] [2022-12-06 07:26:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26: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:26:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489776281] [2022-12-06 07:26:20,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489776281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:20,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:20,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189984631] [2022-12-06 07:26:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:20,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:20,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:20,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:20,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:20,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:20,837 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:20,838 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:20,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:20,852 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:20,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:20,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:20,853 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:20,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:20,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:20,891 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:20,892 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:20,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,892 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,918 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:20,918 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:26:20,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:20,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:20,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:21,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:26:21,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:21,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-06 07:26:21,054 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1581215176, now seen corresponding path program 1 times [2022-12-06 07:26:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797062613] [2022-12-06 07:26:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,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:26:21,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797062613] [2022-12-06 07:26:21,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797062613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:21,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970297277] [2022-12-06 07:26:21,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:21,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:21,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:21,396 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:21,396 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:21,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:21,410 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:21,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:21,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:21,411 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:21,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:21,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:21,448 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:21,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:21,448 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:21,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:21,449 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:21,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:21,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:21,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:21,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:21,474 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:21,475 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:26:21,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:21,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:21,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:21,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:21,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:26:21,636 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:21,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-06 07:26:21,637 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 161595159, now seen corresponding path program 1 times [2022-12-06 07:26:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:21,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585193894] [2022-12-06 07:26:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:21,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:21,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:21,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585193894] [2022-12-06 07:26:21,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585193894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:21,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:21,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828948001] [2022-12-06 07:26:21,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:21,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:21,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:21,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:21,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:21,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,054 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:22,054 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:22,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:22,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:22,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:22,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:22,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:22,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:22,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,112 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:22,113 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:22,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,113 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,139 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:22,139 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:26:22,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:22,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:22,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:26:22,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:22,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-06 07:26:22,282 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1904405494, now seen corresponding path program 1 times [2022-12-06 07:26:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256990730] [2022-12-06 07:26:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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:22,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256990730] [2022-12-06 07:26:22,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256990730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034760942] [2022-12-06 07:26:22,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:22,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:22,630 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:22,630 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:22,645 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:22,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:22,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:22,646 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:22,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:22,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:22,683 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:22,683 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:22,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:22,683 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:22,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:22,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,709 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:22,709 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:22,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:22,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:22,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:22,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:22,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:26:22,863 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:22,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:22,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:22,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-06 07:26:22,863 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:22,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,863 INFO L85 PathProgramCache]: Analyzing trace with hash -647751467, now seen corresponding path program 1 times [2022-12-06 07:26:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774444329] [2022-12-06 07:26:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,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:26:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774444329] [2022-12-06 07:26:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774444329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:22,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:22,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217345849] [2022-12-06 07:26:22,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:22,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:22,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:22,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:22,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:22,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:22,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:22,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,221 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:23,221 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:26:23,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:23,236 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:23,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:23,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:23,239 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:23,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:23,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,278 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:23,278 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:23,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,278 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,304 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:23,305 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:23,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:23,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:23,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:23,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:26:23,461 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:23,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:23,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-06 07:26:23,461 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1095058868, now seen corresponding path program 1 times [2022-12-06 07:26:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:23,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611842131] [2022-12-06 07:26:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:23,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:26:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611842131] [2022-12-06 07:26:23,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611842131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:23,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:23,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159409332] [2022-12-06 07:26:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:23,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:23,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:23,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:23,819 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:23,819 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:23,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:23,833 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:23,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:23,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:23,834 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:23,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:23,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:23,871 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:23,871 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:23,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:23,871 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:23,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:23,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,898 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:23,898 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:26:23,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:23,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:23,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:24,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 07:26:24,084 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-06 07:26:24,084 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1457098093, now seen corresponding path program 1 times [2022-12-06 07:26:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757045475] [2022-12-06 07:26:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757045475] [2022-12-06 07:26:24,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757045475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166016447] [2022-12-06 07:26:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:24,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:24,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:24,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:24,445 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:24,459 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:24,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:24,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:24,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:24,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:24,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:24,498 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:24,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:24,499 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:24,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:24,499 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:24,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:24,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:24,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:24,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:24,525 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:24,525 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:24,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:24,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:24,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:24,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:24,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:26:24,667 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:24,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:24,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:24,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-06 07:26:24,667 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:24,668 INFO L85 PathProgramCache]: Analyzing trace with hash 285712242, now seen corresponding path program 1 times [2022-12-06 07:26:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:24,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708021596] [2022-12-06 07:26:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:24,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:24,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:26:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:24,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708021596] [2022-12-06 07:26:24,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708021596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:24,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:24,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002426979] [2022-12-06 07:26:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:24,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:24,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:24,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:24,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:24,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,064 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:25,064 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:25,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:25,078 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:25,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:25,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:25,087 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:25,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:25,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,121 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:25,121 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:25,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,122 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,147 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:25,147 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:26:25,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:25,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:25,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:26:25,305 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:25,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-06 07:26:25,306 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:25,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2028522577, now seen corresponding path program 1 times [2022-12-06 07:26:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686440161] [2022-12-06 07:26:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,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:26:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686440161] [2022-12-06 07:26:25,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686440161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980669889] [2022-12-06 07:26:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:25,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:25,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:25,652 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:25,652 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:26:25,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:25,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:25,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:25,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:25,665 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:25,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:25,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:25,701 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:25,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:25,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:25,701 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:25,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:25,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,726 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:25,726 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:26:25,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:25,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:25,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:25,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:25,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:26:25,862 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:25,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:25,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:25,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-06 07:26:25,862 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -523634384, now seen corresponding path program 1 times [2022-12-06 07:26:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:25,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933076542] [2022-12-06 07:26:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:25,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:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:25,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933076542] [2022-12-06 07:26:25,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933076542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:25,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:25,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534258637] [2022-12-06 07:26:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:25,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:25,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:25,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:25,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,208 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:26,208 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:26:26,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:26,220 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:26,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:26,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:26,221 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:26,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:26,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:26,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:26,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,282 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:26,282 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:26:26,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:26,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:26,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 07:26:26,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:26,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-06 07:26:26,413 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1219175951, now seen corresponding path program 1 times [2022-12-06 07:26:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083710290] [2022-12-06 07:26:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:26,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:26:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083710290] [2022-12-06 07:26:26,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083710290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:26,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:26,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934560612] [2022-12-06 07:26:26,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:26,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:26,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:26,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:26,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:26,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:26,741 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:26,741 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:26,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:26,755 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:26,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:26,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:26,756 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:26,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:26,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:26,791 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:26,791 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:26,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:26,791 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:26,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:26,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:26,817 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:26,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:26,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:26,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:26,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:26,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:26:26,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:26,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:26,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:26,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-06 07:26:26,950 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1332981010, now seen corresponding path program 1 times [2022-12-06 07:26:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:26,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555235622] [2022-12-06 07:26:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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:26:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555235622] [2022-12-06 07:26:27,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555235622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099495904] [2022-12-06 07:26:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:27,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,282 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:27,282 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:26:27,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:27,294 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:27,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:27,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:27,295 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:27,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:27,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,327 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:27,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:27,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,352 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:27,352 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:26:27,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:27,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:27,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:27,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:26:27,496 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:27,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:27,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:27,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-06 07:26:27,496 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 409829325, now seen corresponding path program 1 times [2022-12-06 07:26:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:27,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92786253] [2022-12-06 07:26:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:27,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:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:27,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92786253] [2022-12-06 07:26:27,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92786253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:27,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:27,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93531440] [2022-12-06 07:26:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:27,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:27,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:27,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:27,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:27,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,823 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:27,824 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:27,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:27,836 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:27,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:27,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:27,837 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:27,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:27,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:27,871 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:27,872 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:27,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:27,872 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:27,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:27,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,897 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:27,897 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:26:27,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:27,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:27,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:28,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:26:28,033 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-06 07:26:28,033 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2142327636, now seen corresponding path program 1 times [2022-12-06 07:26:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786720399] [2022-12-06 07:26:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:28,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786720399] [2022-12-06 07:26:28,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786720399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979285779] [2022-12-06 07:26:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:28,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:28,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,376 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:28,376 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:26:28,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:28,389 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:28,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:28,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:28,389 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:28,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:28,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,421 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:28,421 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:28,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,421 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,422 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,446 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:28,446 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:26:28,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:28,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:28,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:28,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:26:28,588 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:28,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:28,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:28,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-06 07:26:28,588 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:28,589 INFO L85 PathProgramCache]: Analyzing trace with hash -399517301, now seen corresponding path program 1 times [2022-12-06 07:26:28,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:28,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777627087] [2022-12-06 07:26:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:28,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:26:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:28,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777627087] [2022-12-06 07:26:28,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777627087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:28,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:28,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:28,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054079925] [2022-12-06 07:26:28,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:28,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:28,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:28,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:28,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:28,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:28,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:28,916 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:28,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:28,928 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:28,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:28,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:28,929 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:28,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:28,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:28,965 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:28,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:28,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:28,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:28,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:28,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,991 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:28,992 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:26:28,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:28,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:28,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:29,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 07:26:29,178 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:29,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-06 07:26:29,178 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1343293034, now seen corresponding path program 1 times [2022-12-06 07:26:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503536691] [2022-12-06 07:26:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503536691] [2022-12-06 07:26:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503536691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298501195] [2022-12-06 07:26:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:29,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:29,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:29,507 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:29,508 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:29,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:29,520 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:29,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:29,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:29,520 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:29,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:29,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:29,553 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:29,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:29,553 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:29,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:29,553 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:29,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:29,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:29,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:29,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:29,579 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:29,579 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:29,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:29,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:29,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:29,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:26:29,719 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:29,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:29,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-06 07:26:29,720 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1208863927, now seen corresponding path program 1 times [2022-12-06 07:26:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:29,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599621586] [2022-12-06 07:26:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:29,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:26:29,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:29,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599621586] [2022-12-06 07:26:29,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599621586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:29,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:29,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:29,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016033932] [2022-12-06 07:26:29,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:29,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:29,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:29,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:29,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:29,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:29,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:30,045 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:30,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:30,058 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:30,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:30,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:30,059 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:30,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:30,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:30,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:30,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,094 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,119 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:30,119 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:30,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:30,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:30,276 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:26:30,276 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:30,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-06 07:26:30,276 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash 533946408, now seen corresponding path program 1 times [2022-12-06 07:26:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093052070] [2022-12-06 07:26:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093052070] [2022-12-06 07:26:30,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093052070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834957786] [2022-12-06 07:26:30,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:30,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:30,667 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:30,667 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:30,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:30,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:30,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:30,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:30,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:30,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:30,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:30,718 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:30,719 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:30,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:30,719 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:30,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:30,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,744 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:30,744 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:26:30,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:30,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:30,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:30,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:30,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:26:30,890 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:30,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:30,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-06 07:26:30,891 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2018210553, now seen corresponding path program 1 times [2022-12-06 07:26:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:30,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402524238] [2022-12-06 07:26:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:30,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:26:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:30,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402524238] [2022-12-06 07:26:30,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402524238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:30,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:30,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622079725] [2022-12-06 07:26:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:30,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:30,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:30,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:30,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:30,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,225 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:31,225 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:31,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13539 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:31,240 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:31,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:31,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:31,241 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:31,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:31,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,274 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:31,274 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:31,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,300 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:31,300 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:26:31,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:31,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:31,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:31,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:31,444 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:31,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:31,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:31,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-06 07:26:31,444 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -275400218, now seen corresponding path program 1 times [2022-12-06 07:26:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976873221] [2022-12-06 07:26:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:31,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:26:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976873221] [2022-12-06 07:26:31,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976873221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:31,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:31,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844882975] [2022-12-06 07:26:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:31,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:31,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:31,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:31,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:31,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:31,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:31,776 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:31,777 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:31,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:31,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:31,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:31,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:31,792 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:31,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:31,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:31,829 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:31,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:31,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:31,829 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:31,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:31,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,855 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:31,855 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:26:31,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:31,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:31,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:32,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:26:32,018 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:32,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:32,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-06 07:26:32,018 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1467410117, now seen corresponding path program 1 times [2022-12-06 07:26:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706522315] [2022-12-06 07:26:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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:26:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706522315] [2022-12-06 07:26:32,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706522315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447326593] [2022-12-06 07:26:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:32,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:32,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,363 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:32,364 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:32,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:32,377 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:32,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:32,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:32,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:32,378 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:32,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:32,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:32,412 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:32,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:32,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:32,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:32,413 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:32,413 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:32,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:32,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:32,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:32,438 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:32,438 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:26:32,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:32,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:32,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:32,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:32,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:26:32,582 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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, 1, 1, 1, 1, 1] [2022-12-06 07:26:32,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-06 07:26:32,582 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1084746844, now seen corresponding path program 1 times [2022-12-06 07:26:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:32,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279603293] [2022-12-06 07:26:32,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:32,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:32,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:26:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279603293] [2022-12-06 07:26:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279603293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:32,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:32,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816839185] [2022-12-06 07:26:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:32,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:32,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:32,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:32,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:32,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:32,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:32,960 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:32,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:32,973 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:32,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:32,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:32,974 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:32,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:33,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,011 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:33,011 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:33,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,012 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,038 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:33,038 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:26:33,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:33,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:33,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:26:33,191 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:33,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-06 07:26:33,192 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:33,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash 658063491, now seen corresponding path program 1 times [2022-12-06 07:26:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345997613] [2022-12-06 07:26:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,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:26:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345997613] [2022-12-06 07:26:33,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345997613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435766353] [2022-12-06 07:26:33,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:33,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:33,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:33,530 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:33,531 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:26:33,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:33,544 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:33,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:33,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:33,545 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:33,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:33,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:33,581 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:33,581 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:33,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:33,581 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:33,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:33,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:33,607 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:26:33,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:33,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:33,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:33,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:33,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:26:33,744 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:33,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:33,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-06 07:26:33,744 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1894093470, now seen corresponding path program 1 times [2022-12-06 07:26:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:33,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966456420] [2022-12-06 07:26:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:33,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966456420] [2022-12-06 07:26:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966456420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:33,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:33,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062972023] [2022-12-06 07:26:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:33,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:33,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:33,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:33,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:34,090 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:34,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:34,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:34,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:34,104 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:34,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:34,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:34,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:34,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,163 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:34,163 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:26:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:34,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:34,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:26:34,320 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:34,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-06 07:26:34,320 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash -151283135, now seen corresponding path program 1 times [2022-12-06 07:26:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595015516] [2022-12-06 07:26:34,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:34,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:34,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:34,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595015516] [2022-12-06 07:26:34,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595015516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:34,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:34,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995482246] [2022-12-06 07:26:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:34,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:34,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:34,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:34,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:34,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:34,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:34,717 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:34,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:34,735 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:34,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:34,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:34,737 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:34,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:34,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:34,787 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:34,788 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:34,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:34,788 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:34,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:34,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,816 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:34,816 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:26:34,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:34,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:34,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:34,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:34,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 07:26:34,991 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:34,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:34,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-06 07:26:34,991 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1591527200, now seen corresponding path program 1 times [2022-12-06 07:26:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:34,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882761541] [2022-12-06 07:26:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,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:26:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882761541] [2022-12-06 07:26:35,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882761541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679573550] [2022-12-06 07:26:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:35,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:35,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:35,354 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:35,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:35,368 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:35,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:35,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:35,369 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:35,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:35,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,406 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:35,406 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:35,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,406 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,432 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:35,432 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 07:26:35,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3339/3551 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:35,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:35,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:35,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:26:35,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:35,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:35,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:35,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-06 07:26:35,570 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash -960629761, now seen corresponding path program 1 times [2022-12-06 07:26:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:35,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798283870] [2022-12-06 07:26:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:35,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798283870] [2022-12-06 07:26:35,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798283870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:35,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:35,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641537825] [2022-12-06 07:26:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:35,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:35,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:35,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:35,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:35,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:35,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:35,897 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:35,897 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:26:35,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:35,911 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:35,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:35,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:35,912 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:35,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:35,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:35,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:35,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:35,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:35,946 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:35,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:35,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,972 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:35,972 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:26:35,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:35,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:35,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:36,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:36,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:36,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-06 07:26:36,116 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 782180574, now seen corresponding path program 1 times [2022-12-06 07:26:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741726376] [2022-12-06 07:26:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,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:26:36,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741726376] [2022-12-06 07:26:36,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741726376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632068218] [2022-12-06 07:26:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:36,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:36,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:36,521 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:36,521 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:36,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:36,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:36,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:36,541 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:36,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:36,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:36,583 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:36,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:36,584 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:36,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:36,584 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:36,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:36,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:36,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:36,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:36,609 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:36,610 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:36,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:36,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:36,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:36,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:36,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:26:36,763 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:36,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:36,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-06 07:26:36,764 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1769976387, now seen corresponding path program 1 times [2022-12-06 07:26:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:36,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072584717] [2022-12-06 07:26:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:36,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:26:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:36,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072584717] [2022-12-06 07:26:36,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072584717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:36,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:36,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707712231] [2022-12-06 07:26:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:36,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:36,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:36,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:36,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:36,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:36,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,165 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:37,165 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:37,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:37,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:37,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:37,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:37,183 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:37,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:37,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,222 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:37,222 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:37,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,222 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,250 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:37,250 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:37,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:37,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:37,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:37,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 07:26:37,428 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:37,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:37,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:37,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-06 07:26:37,428 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -27166052, now seen corresponding path program 1 times [2022-12-06 07:26:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:37,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195672214] [2022-12-06 07:26:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:37,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:26:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:37,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195672214] [2022-12-06 07:26:37,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195672214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:37,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:37,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780190763] [2022-12-06 07:26:37,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:37,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:37,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:37,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:37,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:37,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:37,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:37,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:37,798 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:37,798 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:37,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:37,812 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:37,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:37,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:37,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:37,813 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:37,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:37,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:37,849 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:37,849 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:37,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,849 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,874 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:37,875 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:26:37,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:37,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:37,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:38,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:26:38,020 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:38,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-06 07:26:38,021 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1715644283, now seen corresponding path program 1 times [2022-12-06 07:26:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920603159] [2022-12-06 07:26:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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:26:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920603159] [2022-12-06 07:26:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920603159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170701414] [2022-12-06 07:26:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:38,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:38,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,361 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:38,361 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:38,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:38,379 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:38,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:38,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:38,380 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:38,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:38,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,418 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:38,418 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:38,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,418 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,446 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:38,446 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:26:38,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:38,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:38,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:38,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:26:38,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:38,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:38,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:38,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-06 07:26:38,590 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -836512678, now seen corresponding path program 1 times [2022-12-06 07:26:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:38,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146907704] [2022-12-06 07:26:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:38,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:26:38,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:38,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146907704] [2022-12-06 07:26:38,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146907704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:38,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:38,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975438760] [2022-12-06 07:26:38,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:38,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:38,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:38,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:38,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:38,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:38,942 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:38,942 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:38,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:38,956 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:38,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:38,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:38,956 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:38,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:38,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:38,992 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:38,992 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:38,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:38,992 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:38,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:38,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,018 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:39,018 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:39,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:39,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:39,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:26:39,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:39,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-06 07:26:39,185 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 906297657, now seen corresponding path program 1 times [2022-12-06 07:26:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141422566] [2022-12-06 07:26:39,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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:26:39,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141422566] [2022-12-06 07:26:39,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141422566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520524409] [2022-12-06 07:26:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:39,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:39,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:39,555 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:39,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:39,569 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:39,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:39,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:39,570 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:39,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:39,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:39,606 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:39,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:39,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:39,607 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:39,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:39,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,633 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:39,633 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:39,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:39,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:39,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:39,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:39,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:26:39,781 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:39,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:39,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:39,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-06 07:26:39,781 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1645859304, now seen corresponding path program 1 times [2022-12-06 07:26:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:39,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916529205] [2022-12-06 07:26:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:39,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:26:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916529205] [2022-12-06 07:26:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916529205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:39,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986117096] [2022-12-06 07:26:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:39,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:39,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:39,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:39,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:39,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,122 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:40,122 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:40,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:40,135 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:40,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:40,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:40,136 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:40,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:40,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,170 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:40,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:40,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,171 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,195 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:40,196 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:26:40,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:40,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:40,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 07:26:40,327 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:40,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-06 07:26:40,327 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 96951031, now seen corresponding path program 1 times [2022-12-06 07:26:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509878959] [2022-12-06 07:26:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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:26:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509878959] [2022-12-06 07:26:40,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509878959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780695318] [2022-12-06 07:26:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:40,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:40,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:40,656 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:40,657 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:26:40,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:40,670 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:40,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:40,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:40,671 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:40,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:40,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:40,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:40,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:40,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:40,707 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:40,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:40,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,733 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:40,733 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:26:40,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:40,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:40,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:40,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:40,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:40,872 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:40,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:40,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:40,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-06 07:26:40,872 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1839761366, now seen corresponding path program 1 times [2022-12-06 07:26:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:40,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143138760] [2022-12-06 07:26:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:40,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:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:40,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143138760] [2022-12-06 07:26:40,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143138760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:40,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:40,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366649520] [2022-12-06 07:26:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:40,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:40,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:40,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:40,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:40,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:40,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:40,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:41,210 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:41,223 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:41,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:41,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:41,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:41,224 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:41,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:41,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:41,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:41,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,282 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:41,282 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:41,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:41,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:41,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:26:41,428 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:41,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-06 07:26:41,428 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash -712395595, now seen corresponding path program 1 times [2022-12-06 07:26:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662235040] [2022-12-06 07:26:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:41,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:26:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662235040] [2022-12-06 07:26:41,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662235040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:41,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:41,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:41,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939061455] [2022-12-06 07:26:41,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:41,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:41,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:41,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:41,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:41,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:41,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:41,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:41,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:41,756 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:41,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:41,770 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:41,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:41,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:41,770 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:41,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:41,810 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:41,810 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:41,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:41,810 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:41,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:41,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,836 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:41,836 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:26:41,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:41,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:41,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:41,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:41,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:26:41,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:41,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:41,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:41,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-06 07:26:41,989 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1030414740, now seen corresponding path program 1 times [2022-12-06 07:26:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:41,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738792096] [2022-12-06 07:26:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,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:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738792096] [2022-12-06 07:26:42,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738792096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522500534] [2022-12-06 07:26:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:42,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:42,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,333 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:42,333 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:26:42,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:42,347 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:42,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:42,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:42,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:42,348 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:42,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:42,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,387 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:42,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:42,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,388 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,414 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:42,414 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:26:42,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:42,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:42,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:42,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:26:42,572 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:42,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:42,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:42,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-06 07:26:42,572 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1521742221, now seen corresponding path program 1 times [2022-12-06 07:26:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:42,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025252161] [2022-12-06 07:26:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:42,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:26:42,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:42,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025252161] [2022-12-06 07:26:42,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025252161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:42,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:42,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:42,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632459429] [2022-12-06 07:26:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:42,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:42,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:42,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:42,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:42,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:42,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:42,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:42,916 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:42,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:42,928 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:42,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:42,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:42,929 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:42,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:42,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:42,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:42,964 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:42,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:42,964 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:42,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:42,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,989 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:42,990 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:42,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:42,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:42,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:43,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:26:43,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:43,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-06 07:26:43,130 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash 221068114, now seen corresponding path program 1 times [2022-12-06 07:26:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671780438] [2022-12-06 07:26:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,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:26:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671780438] [2022-12-06 07:26:43,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671780438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363733181] [2022-12-06 07:26:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:43,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:43,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:43,490 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:43,490 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:26:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:43,505 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:43,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:43,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:43,506 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:43,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:43,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:43,545 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:43,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:43,545 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:43,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:43,546 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:43,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:43,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:43,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:43,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:43,572 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:43,572 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:26:43,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:43,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:43,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:43,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:43,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:26:43,728 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:43,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:43,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:43,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-06 07:26:43,728 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1963878449, now seen corresponding path program 1 times [2022-12-06 07:26:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:43,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271663169] [2022-12-06 07:26:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:43,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:26:43,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:43,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271663169] [2022-12-06 07:26:43,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271663169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:43,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:43,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:43,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107251881] [2022-12-06 07:26:43,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:43,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:43,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:43,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:43,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:43,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:43,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:44,056 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:26:44,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:44,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:44,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:44,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:44,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:44,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:44,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,105 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:44,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:44,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,130 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:44,130 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:26:44,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:44,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:44,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:44,275 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:44,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-06 07:26:44,276 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash -588278512, now seen corresponding path program 1 times [2022-12-06 07:26:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569155876] [2022-12-06 07:26:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,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:26:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569155876] [2022-12-06 07:26:44,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569155876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:44,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336662879] [2022-12-06 07:26:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:44,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:44,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:44,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:44,595 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:44,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:44,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:44,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:44,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:44,608 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:44,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:44,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:44,644 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:44,644 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:44,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:44,644 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:44,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:44,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,670 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:44,670 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:26:44,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:44,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:44,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:44,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:44,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:26:44,821 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:44,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:44,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-06 07:26:44,822 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1154531823, now seen corresponding path program 1 times [2022-12-06 07:26:44,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:44,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433500480] [2022-12-06 07:26:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:44,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:44,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:26:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:44,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433500480] [2022-12-06 07:26:44,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433500480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:44,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:44,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107431135] [2022-12-06 07:26:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:44,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:44,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:44,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:44,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:44,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,142 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:45,142 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:45,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:45,156 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:45,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:45,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:45,157 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:45,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:45,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,193 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:45,193 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:45,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,193 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,218 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:45,219 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:26:45,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:45,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:45,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:45,358 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:45,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-06 07:26:45,359 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1397625138, now seen corresponding path program 1 times [2022-12-06 07:26:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576483443] [2022-12-06 07:26:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,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:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576483443] [2022-12-06 07:26:45,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576483443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:45,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220974039] [2022-12-06 07:26:45,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:45,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:45,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:45,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:45,713 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:45,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:45,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:45,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:45,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:45,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:45,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:45,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:45,763 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:45,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:45,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:45,764 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:45,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:45,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,789 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:45,789 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:45,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:45,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:45,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:45,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:26:45,932 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:45,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:45,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:45,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-06 07:26:45,933 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 345185197, now seen corresponding path program 1 times [2022-12-06 07:26:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:45,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209548650] [2022-12-06 07:26:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209548650] [2022-12-06 07:26:45,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209548650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:45,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:45,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175212198] [2022-12-06 07:26:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:45,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:45,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:45,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:45,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:45,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,274 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:46,274 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:46,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:46,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:46,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:46,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:46,287 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:46,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:46,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:46,323 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:46,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,348 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:46,348 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:26:46,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:46,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:46,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:46,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:26:46,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:46,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:46,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:46,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-06 07:26:46,502 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2087995532, now seen corresponding path program 1 times [2022-12-06 07:26:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296669437] [2022-12-06 07:26:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:46,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:26:46,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:46,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296669437] [2022-12-06 07:26:46,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296669437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:46,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:46,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998524639] [2022-12-06 07:26:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:46,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:46,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:46,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:46,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:46,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:46,860 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:46,860 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:46,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:46,875 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:46,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:46,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:46,876 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:46,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:46,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:46,913 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:46,913 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:46,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:46,913 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:46,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:46,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,941 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:46,941 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:26:46,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:46,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:46,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:47,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:26:47,094 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:47,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-06 07:26:47,094 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash -464161429, now seen corresponding path program 1 times [2022-12-06 07:26:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521149708] [2022-12-06 07:26:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,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:47,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521149708] [2022-12-06 07:26:47,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521149708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:47,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768911575] [2022-12-06 07:26:47,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:47,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:47,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,435 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:47,435 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:47,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:47,448 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:47,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:47,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:47,449 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:47,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:47,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:47,485 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:47,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:47,485 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:47,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:47,485 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:47,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:47,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:47,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:47,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:47,516 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:47,516 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:47,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:47,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:47,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:47,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:47,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:26:47,659 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:47,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:47,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:47,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-06 07:26:47,660 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1278648906, now seen corresponding path program 1 times [2022-12-06 07:26:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368542936] [2022-12-06 07:26:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:47,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:26:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:47,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368542936] [2022-12-06 07:26:47,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368542936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:47,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343823717] [2022-12-06 07:26:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:47,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:47,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:47,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:47,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:47,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:47,998 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:47,999 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:48,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:48,012 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:48,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:48,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:48,015 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:48,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:48,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,051 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:48,052 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:48,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,052 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,077 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:48,077 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:48,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:48,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:48,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:26:48,223 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:48,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,223 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-06 07:26:48,223 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:48,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1273508055, now seen corresponding path program 1 times [2022-12-06 07:26:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376952402] [2022-12-06 07:26:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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:26:48,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376952402] [2022-12-06 07:26:48,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376952402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788814397] [2022-12-06 07:26:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:48,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:48,563 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:48,564 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:48,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:48,578 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:48,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:48,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:48,579 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:48,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:48,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:48,616 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:48,616 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:48,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:48,616 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:48,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:48,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,641 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:48,642 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:48,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:48,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:48,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:48,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:48,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:26:48,786 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:48,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:48,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-06 07:26:48,786 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 469302280, now seen corresponding path program 1 times [2022-12-06 07:26:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356418150] [2022-12-06 07:26:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:48,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:26:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356418150] [2022-12-06 07:26:48,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356418150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:48,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:48,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792458172] [2022-12-06 07:26:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:48,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:48,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:48,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:48,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:48,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:48,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:48,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:48,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,126 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:49,126 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:49,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:49,138 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:49,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:49,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:49,139 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:49,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:49,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,171 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:49,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:49,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,172 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,196 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:49,196 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:26:49,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:49,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:49,331 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:26:49,332 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:49,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-06 07:26:49,332 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2082854681, now seen corresponding path program 1 times [2022-12-06 07:26:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880229222] [2022-12-06 07:26:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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:26:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880229222] [2022-12-06 07:26:49,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880229222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581795583] [2022-12-06 07:26:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:49,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:49,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:49,673 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:49,674 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:49,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:49,689 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:49,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:49,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:49,690 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:49,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:49,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:49,728 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:49,728 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:49,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:49,728 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:49,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:49,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,754 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:49,754 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:26:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:49,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:49,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:49,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:49,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:26:49,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:49,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:49,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-06 07:26:49,913 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -340044346, now seen corresponding path program 1 times [2022-12-06 07:26:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:49,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100247264] [2022-12-06 07:26:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:49,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:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:49,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100247264] [2022-12-06 07:26:49,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100247264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:49,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:49,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597016351] [2022-12-06 07:26:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:49,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:49,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:49,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:49,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:49,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:49,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,258 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:50,258 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:50,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:50,271 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:50,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:50,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:50,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:50,272 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:50,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:50,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:50,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:50,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,306 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,332 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:50,332 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:26:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:50,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:50,478 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:50,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:26:50,479 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:50,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:50,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:50,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-06 07:26:50,479 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1402765989, now seen corresponding path program 1 times [2022-12-06 07:26:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:50,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736775601] [2022-12-06 07:26:50,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:50,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:26:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:50,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736775601] [2022-12-06 07:26:50,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736775601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:50,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:50,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656554722] [2022-12-06 07:26:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:50,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:50,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:50,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:50,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:50,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:50,827 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:50,827 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:50,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13508 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:50,840 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:50,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:50,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:50,841 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:50,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:50,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:50,876 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:50,876 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:50,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:50,876 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:50,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:50,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,901 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:50,901 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:50,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:50,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:50,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:51,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:26:51,040 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:51,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-06 07:26:51,040 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1149390972, now seen corresponding path program 1 times [2022-12-06 07:26:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801538419] [2022-12-06 07:26:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:51,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:26:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:51,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801538419] [2022-12-06 07:26:51,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801538419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:51,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:51,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346158675] [2022-12-06 07:26:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:51,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:51,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:51,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:51,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:51,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:51,382 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:51,382 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:51,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:51,395 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:51,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:51,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:51,396 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:51,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:51,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:51,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:51,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:51,433 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:51,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:51,433 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:51,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:51,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:51,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:51,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:51,459 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:51,459 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:26:51,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:51,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:51,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:51,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:51,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 07:26:51,655 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:51,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-06 07:26:51,655 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 593419363, now seen corresponding path program 1 times [2022-12-06 07:26:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417342384] [2022-12-06 07:26:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:51,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:26:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:51,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417342384] [2022-12-06 07:26:51,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417342384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:51,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:51,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658397436] [2022-12-06 07:26:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:51,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:51,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:51,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:51,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:51,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:51,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,018 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:52,018 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:52,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:52,037 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:52,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:52,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:52,038 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:52,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:52,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,089 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:52,090 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:52,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,090 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,118 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:52,118 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:26:52,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:52,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:52,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 07:26:52,290 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:52,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-06 07:26:52,290 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1958737598, now seen corresponding path program 1 times [2022-12-06 07:26:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490723398] [2022-12-06 07:26:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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:26:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490723398] [2022-12-06 07:26:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490723398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320776779] [2022-12-06 07:26:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:52,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:52,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:52,670 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:52,670 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:52,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:52,694 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:52,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:52,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:52,699 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:52,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:52,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:52,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:52,737 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:52,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:52,737 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:52,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:52,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,763 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:52,763 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:52,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:52,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:52,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:52,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:52,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:26:52,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:52,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:52,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:52,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-06 07:26:52,920 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -215927263, now seen corresponding path program 1 times [2022-12-06 07:26:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:52,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847106675] [2022-12-06 07:26:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:52,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:26:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:52,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847106675] [2022-12-06 07:26:52,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847106675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:52,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:52,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790461326] [2022-12-06 07:26:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:52,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:52,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:52,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:52,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:52,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:53,261 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:53,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:53,275 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:53,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:53,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:53,276 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:53,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:53,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:53,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:53,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,336 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:53,337 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:26:53,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:53,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:53,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:53,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 07:26:53,507 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:53,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:53,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:53,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-06 07:26:53,508 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1526883072, now seen corresponding path program 1 times [2022-12-06 07:26:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:53,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120519384] [2022-12-06 07:26:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:53,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:26:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:53,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120519384] [2022-12-06 07:26:53,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120519384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:53,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:53,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278071019] [2022-12-06 07:26:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:53,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:53,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:53,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:53,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:53,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:53,874 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:53,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:53,888 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:53,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:53,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:53,889 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:53,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:53,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:53,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:53,926 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:53,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:53,926 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:53,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:53,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,951 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:53,952 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:26:53,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:53,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:53,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:54,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:26:54,093 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:54,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-06 07:26:54,093 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1025273889, now seen corresponding path program 1 times [2022-12-06 07:26:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381255074] [2022-12-06 07:26:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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:26:54,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381255074] [2022-12-06 07:26:54,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381255074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131076096] [2022-12-06 07:26:54,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:54,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:54,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:54,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:54,496 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:54,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:54,509 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:54,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:54,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:54,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:54,509 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:54,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:54,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:54,543 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:54,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:54,544 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:54,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:54,544 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:54,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:54,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:54,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:54,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:54,569 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:54,569 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:26:54,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:54,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:54,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:54,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:54,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:26:54,721 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:54,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:54,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:54,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-06 07:26:54,722 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:54,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 717536446, now seen corresponding path program 1 times [2022-12-06 07:26:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:54,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327591845] [2022-12-06 07:26:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:54,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:26:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:54,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327591845] [2022-12-06 07:26:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327591845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895869335] [2022-12-06 07:26:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:54,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:54,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:54,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:54,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,069 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:55,070 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:26:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:55,082 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:55,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:55,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:55,083 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:55,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:55,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,117 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:55,118 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:55,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,118 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,143 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:55,143 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:55,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:55,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:55,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:26:55,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:55,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-06 07:26:55,293 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1834620515, now seen corresponding path program 1 times [2022-12-06 07:26:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712265152] [2022-12-06 07:26:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,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:26:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712265152] [2022-12-06 07:26:55,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712265152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879017555] [2022-12-06 07:26:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:55,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:55,625 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:55,625 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:55,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:55,641 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:55,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:55,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:55,642 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:55,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:55,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:55,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:55,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:55,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:55,679 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:55,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:55,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:55,704 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:26:55,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:55,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:55,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:55,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:55,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:26:55,846 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:55,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:55,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:55,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-06 07:26:55,847 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash -91810180, now seen corresponding path program 1 times [2022-12-06 07:26:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:55,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477015407] [2022-12-06 07:26:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:55,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:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477015407] [2022-12-06 07:26:55,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477015407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:55,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:55,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108013662] [2022-12-06 07:26:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:55,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:55,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:55,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:55,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:55,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:55,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,177 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:56,177 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:56,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:56,190 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:56,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:56,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:56,191 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:56,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:56,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,226 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:56,226 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:56,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,226 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,251 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:56,251 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:26:56,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:56,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:56,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:26:56,398 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-06 07:26:56,398 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1651000155, now seen corresponding path program 1 times [2022-12-06 07:26:56,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238775886] [2022-12-06 07:26:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:56,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:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:56,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238775886] [2022-12-06 07:26:56,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238775886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:56,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:56,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426112275] [2022-12-06 07:26:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:56,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:56,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:56,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:56,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:56,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:56,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:56,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:56,744 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:56,744 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:26:56,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:56,758 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:56,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:56,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:56,759 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:56,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:56,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:56,796 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:56,796 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:56,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:56,796 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:56,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:56,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,821 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:56,821 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:26:56,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3017 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:56,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:56,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:56,975 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:56,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:26:56,975 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:56,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:56,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:56,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-06 07:26:56,976 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -901156806, now seen corresponding path program 1 times [2022-12-06 07:26:56,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:56,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945449682] [2022-12-06 07:26:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:56,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:57,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:26:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945449682] [2022-12-06 07:26:57,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945449682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83474338] [2022-12-06 07:26:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:57,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:57,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,304 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:57,304 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:26:57,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:57,317 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:57,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:57,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:57,318 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:57,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,352 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:57,352 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:57,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,352 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,378 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:26:57,378 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:26:57,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:26:57,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:57,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:57,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:26:57,527 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:57,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:57,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:57,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-06 07:26:57,528 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 841653529, now seen corresponding path program 1 times [2022-12-06 07:26:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:57,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554480125] [2022-12-06 07:26:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:57,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:26:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:57,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554480125] [2022-12-06 07:26:57,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554480125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:57,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:57,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176088713] [2022-12-06 07:26:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:57,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:57,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:57,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:57,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:57,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:57,874 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:26:57,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:57,887 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:57,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:57,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:57,888 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:57,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:57,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:57,921 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,921 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:57,922 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:57,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:57,922 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:57,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:57,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,947 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:57,947 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:26:57,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:57,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:57,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:58,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:26:58,090 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:58,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-06 07:26:58,090 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1710503432, now seen corresponding path program 1 times [2022-12-06 07:26:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972368252] [2022-12-06 07:26:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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:26:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972368252] [2022-12-06 07:26:58,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972368252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770957686] [2022-12-06 07:26:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:58,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:58,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:58,427 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:58,427 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:26:58,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:58,440 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:58,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:58,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:58,441 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:58,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:58,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:58,475 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:58,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:58,475 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:58,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:58,475 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:58,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:58,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:58,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:58,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:58,501 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:58,501 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:26:58,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:58,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:58,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:58,650 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:58,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:26:58,651 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:58,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:58,651 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:58,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-06 07:26:58,651 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 32306903, now seen corresponding path program 1 times [2022-12-06 07:26:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:58,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105695943] [2022-12-06 07:26:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:58,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:26:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:58,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105695943] [2022-12-06 07:26:58,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105695943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:58,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:58,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144605731] [2022-12-06 07:26:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:58,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:58,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:58,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:58,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:58,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:58,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:58,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:58,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,007 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:59,008 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:26:59,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:59,021 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:59,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:59,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:59,022 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:59,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:59,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,055 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:59,055 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:59,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,055 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,081 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:59,081 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:26:59,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:59,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:59,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:59,220 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-06 07:26:59,220 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1775117238, now seen corresponding path program 1 times [2022-12-06 07:26:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937084393] [2022-12-06 07:26:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,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:59,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937084393] [2022-12-06 07:26:59,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937084393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399190077] [2022-12-06 07:26:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:59,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:59,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:59,565 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:26:59,566 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:26:59,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:26:59,578 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:26:59,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:26:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:26:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:26:59,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:26:59,579 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:26:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:26:59,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:26:59,612 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:26:59,612 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:26:59,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:59,612 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:59,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:59,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,637 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:26:59,637 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:26:59,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:26:59,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:26:59,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:26:59,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:26:59,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:26:59,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:26:59,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:59,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:59,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-06 07:26:59,778 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:26:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -777039723, now seen corresponding path program 1 times [2022-12-06 07:26:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398980329] [2022-12-06 07:26:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:59,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:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:59,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398980329] [2022-12-06 07:26:59,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398980329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:26:59,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:26:59,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:26:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673680846] [2022-12-06 07:26:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:26:59,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:26:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:26:59,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:26:59,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:26:59,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:59,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:26:59,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,114 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:00,114 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:00,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13563 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:00,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:00,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:00,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:00,129 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:00,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:00,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:00,164 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:00,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,164 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,190 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:00,190 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:27:00,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:00,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:00,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:00,335 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:00,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-06 07:27:00,335 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash 965770612, now seen corresponding path program 1 times [2022-12-06 07:27:00,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603624763] [2022-12-06 07:27:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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:27:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603624763] [2022-12-06 07:27:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603624763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385231468] [2022-12-06 07:27:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:00,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:00,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:00,675 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:00,675 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:00,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:00,690 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:00,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:00,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:00,691 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:00,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:00,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:00,726 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:00,727 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:00,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:00,727 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:00,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:00,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,752 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:00,753 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:00,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:00,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:00,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:00,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:00,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:27:00,907 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:00,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:00,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-06 07:27:00,908 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1586386349, now seen corresponding path program 1 times [2022-12-06 07:27:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:00,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464339449] [2022-12-06 07:27:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:00,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:27:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:00,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464339449] [2022-12-06 07:27:00,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464339449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:00,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:00,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:00,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904221841] [2022-12-06 07:27:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:00,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:00,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:00,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:00,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:00,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:01,231 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:01,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:01,248 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:01,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:01,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:01,249 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:01,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:01,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,286 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:01,287 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:01,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,287 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,313 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:01,314 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:27:01,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:01,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:01,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:01,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:27:01,466 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:01,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:01,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:01,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-06 07:27:01,467 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash 156423986, now seen corresponding path program 1 times [2022-12-06 07:27:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:01,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175222517] [2022-12-06 07:27:01,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:01,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:27:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:01,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175222517] [2022-12-06 07:27:01,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175222517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:01,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:01,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422193905] [2022-12-06 07:27:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:01,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:01,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:01,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:01,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:01,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:01,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:01,817 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:01,818 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:01,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:01,831 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:01,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:01,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:01,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:01,832 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:01,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:01,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:01,866 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:01,867 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:01,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:01,867 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:01,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:01,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,892 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:01,892 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:01,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:01,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:01,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:02,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:27:02,033 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:02,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-06 07:27:02,033 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1899234321, now seen corresponding path program 1 times [2022-12-06 07:27:02,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403442058] [2022-12-06 07:27:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403442058] [2022-12-06 07:27:02,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403442058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275980826] [2022-12-06 07:27:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:02,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:02,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,373 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:02,373 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:27:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:02,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:02,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:02,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:02,387 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:02,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:02,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:02,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:02,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,445 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:02,445 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:02,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:02,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:02,580 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:02,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:27:02,581 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:02,581 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:02,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-06 07:27:02,581 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -652922640, now seen corresponding path program 1 times [2022-12-06 07:27:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114877774] [2022-12-06 07:27:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:02,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:27:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114877774] [2022-12-06 07:27:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114877774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:02,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:02,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927198037] [2022-12-06 07:27:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:02,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:02,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:02,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:02,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:02,937 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:02,937 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:02,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:02,950 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:02,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:02,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:02,951 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:02,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:02,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:02,983 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:02,984 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:02,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:02,984 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:02,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:02,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:02,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,012 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:03,012 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:27:03,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:03,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:03,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:27:03,170 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:03,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-06 07:27:03,171 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:03,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1089887695, now seen corresponding path program 1 times [2022-12-06 07:27:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575523916] [2022-12-06 07:27:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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:27:03,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575523916] [2022-12-06 07:27:03,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575523916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418275359] [2022-12-06 07:27:03,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:03,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:03,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:03,522 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:03,522 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:03,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:03,535 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:03,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:03,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:03,536 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:03,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:03,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:03,569 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:03,569 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:03,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:03,569 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:03,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:03,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,595 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:03,595 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:27:03,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:03,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:03,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:03,736 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:03,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:03,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:03,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:03,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:03,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-06 07:27:03,736 INFO L420 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1462269266, now seen corresponding path program 1 times [2022-12-06 07:27:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:03,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539641492] [2022-12-06 07:27:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:03,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:27:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:03,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539641492] [2022-12-06 07:27:03,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539641492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:03,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:03,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:03,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351461241] [2022-12-06 07:27:03,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:03,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:03,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:03,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:03,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:03,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:03,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:03,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:03,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:04,097 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:27:04,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:04,110 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:04,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:04,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:04,111 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:04,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:04,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,146 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:04,146 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:04,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,146 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,171 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:04,172 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:04,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:04,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:04,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:27:04,328 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:04,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:04,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-06 07:27:04,328 INFO L420 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 280541069, now seen corresponding path program 1 times [2022-12-06 07:27:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:04,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446662088] [2022-12-06 07:27:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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:27:04,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446662088] [2022-12-06 07:27:04,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446662088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35137665] [2022-12-06 07:27:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:04,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:04,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:04,665 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:04,665 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:04,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13586 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:04,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:04,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:04,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:04,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:04,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:04,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:04,723 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:04,723 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:04,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:04,723 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:04,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:04,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,751 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:04,751 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:27:04,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:04,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:04,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:04,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:04,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:27:04,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:04,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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, 1, 1, 1, 1, 1] [2022-12-06 07:27:04,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-06 07:27:04,913 INFO L420 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [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 2023351404, 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 [996904240] [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,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:04,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:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:04,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996904240] [2022-12-06 07:27:04,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996904240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:04,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:04,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037044640] [2022-12-06 07:27:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:04,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:04,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:04,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:04,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:04,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:04,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,243 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:05,243 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:05,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:05,257 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:05,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:05,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:05,262 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:05,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,297 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:05,297 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:05,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,297 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,323 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:05,324 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:05,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:05,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:05,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:05,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:27:05,469 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:05,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:05,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:05,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-06 07:27:05,469 INFO L420 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash -528805557, now seen corresponding path program 1 times [2022-12-06 07:27:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:05,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649105937] [2022-12-06 07:27:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:05,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649105937] [2022-12-06 07:27:05,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649105937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:05,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:05,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141222032] [2022-12-06 07:27:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:05,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:05,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:05,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:05,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:05,801 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:05,801 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:05,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:05,814 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:05,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:05,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:05,815 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:05,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:05,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:05,856 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:05,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:05,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:05,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:05,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:05,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,882 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:05,883 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:27:05,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:05,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:05,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:06,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:06,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:06,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-06 07:27:06,023 INFO L420 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1214004778, now seen corresponding path program 1 times [2022-12-06 07:27:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014762465] [2022-12-06 07:27:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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:27:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014762465] [2022-12-06 07:27:06,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014762465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11842851] [2022-12-06 07:27:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:06,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:06,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,351 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:06,351 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:06,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:06,363 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:06,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:06,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:06,364 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:06,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:06,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:06,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:06,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,397 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,422 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:06,423 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:06,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:06,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:06,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:06,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:27:06,555 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:06,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:06,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:06,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-06 07:27:06,555 INFO L420 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1338152183, now seen corresponding path program 1 times [2022-12-06 07:27:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:06,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711710035] [2022-12-06 07:27:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:06,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:27:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:06,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711710035] [2022-12-06 07:27:06,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711710035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:06,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:06,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676560874] [2022-12-06 07:27:06,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:06,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:06,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:06,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:06,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:06,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:06,907 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:06,908 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:06,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:06,921 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:06,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:06,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:06,922 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:06,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:06,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:06,956 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:06,957 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:06,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:06,957 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:06,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:06,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,982 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:06,982 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:27:06,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:06,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:06,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:07,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:07,128 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:07,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-06 07:27:07,129 INFO L420 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 404658152, now seen corresponding path program 1 times [2022-12-06 07:27:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396472632] [2022-12-06 07:27:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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:07,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396472632] [2022-12-06 07:27:07,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396472632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:07,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735443119] [2022-12-06 07:27:07,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:07,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:07,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:07,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:07,484 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:07,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:07,500 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:07,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:07,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:07,501 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:07,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:07,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:07,537 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:07,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:07,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:07,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:07,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:07,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:07,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:07,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:07,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:07,562 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:07,563 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:07,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:07,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:07,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:07,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:27:07,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:07,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:07,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:07,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-06 07:27:07,709 INFO L420 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2147468487, now seen corresponding path program 1 times [2022-12-06 07:27:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:07,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321946757] [2022-12-06 07:27:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:07,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:27:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:07,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321946757] [2022-12-06 07:27:07,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321946757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:07,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:07,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415333399] [2022-12-06 07:27:07,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:07,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:07,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:07,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:07,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:07,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:07,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,055 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:08,056 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:08,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:08,069 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:08,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:08,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:08,070 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:08,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:08,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:08,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:08,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,130 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:08,130 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:27:08,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:08,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:08,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:27:08,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:08,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-06 07:27:08,282 INFO L420 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:08,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash -404688474, now seen corresponding path program 1 times [2022-12-06 07:27:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959676163] [2022-12-06 07:27:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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:08,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959676163] [2022-12-06 07:27:08,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959676163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400964579] [2022-12-06 07:27:08,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:08,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:08,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:08,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:08,632 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:27:08,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:08,644 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:08,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:08,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:08,645 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:08,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:08,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:08,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:08,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:08,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:08,679 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:08,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:08,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:08,704 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:08,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:08,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:08,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:08,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:08,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:27:08,851 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:08,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:08,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:08,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-06 07:27:08,851 INFO L420 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1338121861, now seen corresponding path program 1 times [2022-12-06 07:27:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:08,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839966654] [2022-12-06 07:27:08,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:08,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:27:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839966654] [2022-12-06 07:27:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839966654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:08,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:08,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671852086] [2022-12-06 07:27:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:08,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:08,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:08,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:08,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,192 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:09,192 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:09,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:09,207 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:09,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:09,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:09,208 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:09,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:09,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:09,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:09,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,279 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:09,279 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:09,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:09,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:09,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:09,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:27:09,440 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:09,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:09,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:09,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-06 07:27:09,440 INFO L420 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1214035100, now seen corresponding path program 1 times [2022-12-06 07:27:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:09,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170426176] [2022-12-06 07:27:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:09,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:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:09,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170426176] [2022-12-06 07:27:09,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170426176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:09,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:09,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433324297] [2022-12-06 07:27:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:09,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:09,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:09,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:09,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:09,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:09,790 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:09,790 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:09,804 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:09,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:09,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:09,805 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:09,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:09,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:09,839 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:09,839 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:09,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:09,839 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:09,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:09,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,866 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:09,866 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:09,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:09,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:09,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:10,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:27:10,003 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:10,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-06 07:27:10,003 INFO L420 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 528775235, now seen corresponding path program 1 times [2022-12-06 07:27:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952944201] [2022-12-06 07:27:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,004 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,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:27:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952944201] [2022-12-06 07:27:10,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952944201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034864824] [2022-12-06 07:27:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:10,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,331 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:10,332 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:27:10,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:10,344 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:10,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:10,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:10,345 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:10,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:10,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:10,381 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:10,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,381 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,406 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:10,406 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:10,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:10,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:10,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:10,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:27:10,554 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:10,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-06 07:27:10,555 INFO L420 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2023381726, now seen corresponding path program 1 times [2022-12-06 07:27:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:10,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712376576] [2022-12-06 07:27:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:10,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:27:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:10,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712376576] [2022-12-06 07:27:10,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712376576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:10,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:10,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59860342] [2022-12-06 07:27:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:10,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:10,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:10,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:10,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:10,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:10,894 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:10,895 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:10,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:10,909 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:10,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:10,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:10,909 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:10,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:10,943 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:10,943 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:10,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:10,943 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:10,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:10,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,968 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:10,968 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:10,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2966 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:10,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:10,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:11,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:27:11,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:11,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-06 07:27:11,105 INFO L420 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:11,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash -280571391, now seen corresponding path program 1 times [2022-12-06 07:27:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876326407] [2022-12-06 07:27:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876326407] [2022-12-06 07:27:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876326407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961319808] [2022-12-06 07:27:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:11,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:11,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:11,436 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:11,436 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:11,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:11,451 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:11,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:11,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:11,452 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:11,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:11,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:11,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:11,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:11,492 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:11,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:11,492 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:11,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:11,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:11,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:11,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:11,517 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:11,517 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:11,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:11,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:11,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:11,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:11,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:11,662 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:11,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:11,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:11,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-06 07:27:11,662 INFO L420 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1462238944, now seen corresponding path program 1 times [2022-12-06 07:27:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352659999] [2022-12-06 07:27:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:11,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:27:11,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:11,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352659999] [2022-12-06 07:27:11,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352659999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:11,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:11,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427677024] [2022-12-06 07:27:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:11,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:11,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:11,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:11,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:11,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:11,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:11,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,013 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:12,013 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:12,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:12,027 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:12,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:12,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:12,028 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:12,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:12,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,064 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:12,064 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:12,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,064 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,090 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:12,090 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:27:12,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:12,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:12,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:27:12,227 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:12,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-06 07:27:12,227 INFO L420 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1089918017, now seen corresponding path program 1 times [2022-12-06 07:27:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557086216] [2022-12-06 07:27:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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:27:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557086216] [2022-12-06 07:27:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557086216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156982450] [2022-12-06 07:27:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:12,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:12,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:12,575 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:12,576 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:12,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:12,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:12,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:12,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:12,591 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:12,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:12,628 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:12,629 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:12,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:12,629 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:12,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:12,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,656 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:12,656 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:27:12,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:12,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:12,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:12,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:12,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:27:12,805 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:12,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:12,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:12,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-06 07:27:12,805 INFO L420 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 652892318, now seen corresponding path program 1 times [2022-12-06 07:27:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:12,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792246693] [2022-12-06 07:27:12,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:12,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:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792246693] [2022-12-06 07:27:12,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792246693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:12,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:12,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341665222] [2022-12-06 07:27:12,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:12,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:12,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:12,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:12,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:12,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:12,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,138 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:13,138 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:27:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:13,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:13,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:13,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:13,153 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:13,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:13,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,190 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:13,190 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:13,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,191 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,217 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:13,217 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:13,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:13,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:13,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:27:13,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-06 07:27:13,368 INFO L420 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1899264643, now seen corresponding path program 1 times [2022-12-06 07:27:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103862240] [2022-12-06 07:27:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:13,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:27:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:13,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103862240] [2022-12-06 07:27:13,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103862240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:13,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:13,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051473173] [2022-12-06 07:27:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:13,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:13,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:13,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:13,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:13,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:13,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:13,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:13,761 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:13,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:13,776 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:13,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:13,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:13,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:13,777 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:13,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:13,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:13,814 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:13,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:13,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:13,815 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:13,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:13,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,840 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:13,840 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:13,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:13,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:13,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:13,992 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:13,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:27:13,992 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:13,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:13,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-06 07:27:13,992 INFO L420 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash -156454308, now seen corresponding path program 1 times [2022-12-06 07:27:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:13,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545844504] [2022-12-06 07:27:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:13,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545844504] [2022-12-06 07:27:14,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545844504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922243861] [2022-12-06 07:27:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:14,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,320 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:14,320 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:14,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:14,333 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:14,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:14,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:14,334 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:14,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:14,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,368 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:14,368 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:14,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,368 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,394 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:14,394 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:27:14,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:14,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:14,548 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:14,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:27:14,548 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:14,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:14,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:14,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-06 07:27:14,549 INFO L420 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1586356027, now seen corresponding path program 1 times [2022-12-06 07:27:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:14,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224656096] [2022-12-06 07:27:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:14,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:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:14,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224656096] [2022-12-06 07:27:14,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224656096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:14,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:14,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902458726] [2022-12-06 07:27:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:14,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:14,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:14,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:14,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:14,889 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:14,889 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:14,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:14,902 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:14,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:14,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:14,903 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:14,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:14,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:14,937 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:14,938 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:14,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:14,938 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:14,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:14,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,963 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:14,964 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:27:14,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:14,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:14,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:15,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:27:15,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:15,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2022-12-06 07:27:15,118 INFO L420 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -965800934, now seen corresponding path program 1 times [2022-12-06 07:27:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52374832] [2022-12-06 07:27:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52374832] [2022-12-06 07:27:15,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52374832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429280114] [2022-12-06 07:27:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:15,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:15,446 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:15,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:15,459 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:15,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:15,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:15,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:15,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:15,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:15,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:15,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:15,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:15,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:15,494 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:15,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:15,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:15,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:15,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:15,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:15,520 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:15,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2963 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:15,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:15,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:15,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:15,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:15,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:15,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:15,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:15,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-06 07:27:15,661 INFO L420 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 777009401, now seen corresponding path program 1 times [2022-12-06 07:27:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:15,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548076375] [2022-12-06 07:27:15,661 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,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:15,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:27:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:15,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548076375] [2022-12-06 07:27:15,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548076375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:15,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:15,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:15,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837686900] [2022-12-06 07:27:15,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:15,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:15,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:15,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:15,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:15,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:15,981 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:15,981 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:15,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:15,995 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:15,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:15,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:15,996 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:15,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:16,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:16,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:16,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,030 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,055 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:16,055 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:16,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:16,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:16,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:27:16,187 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:16,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-06 07:27:16,187 INFO L420 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1775147560, now seen corresponding path program 1 times [2022-12-06 07:27:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929391273] [2022-12-06 07:27:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,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:27:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929391273] [2022-12-06 07:27:16,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929391273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626029589] [2022-12-06 07:27:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:16,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:16,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:16,515 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:16,515 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:16,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:16,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:16,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:16,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:16,531 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:16,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:16,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:16,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:16,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:16,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:16,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:16,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,593 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:16,593 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:27:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:16,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:16,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:16,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:16,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:27:16,748 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:16,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:16,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:16,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2022-12-06 07:27:16,748 INFO L420 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash -32337225, now seen corresponding path program 1 times [2022-12-06 07:27:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450171424] [2022-12-06 07:27:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:16,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450171424] [2022-12-06 07:27:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450171424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:16,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:16,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237256237] [2022-12-06 07:27:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:16,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:16,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:16,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:16,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:16,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:16,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:16,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,093 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:17,093 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13534 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:17,107 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:17,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:17,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:17,108 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:17,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:17,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,145 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:17,145 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:17,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,145 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,171 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:17,171 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:17,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:17,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:17,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:27:17,324 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:17,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-06 07:27:17,324 INFO L420 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1710473110, now seen corresponding path program 1 times [2022-12-06 07:27:17,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636942173] [2022-12-06 07:27:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:17,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:27:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636942173] [2022-12-06 07:27:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636942173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278152598] [2022-12-06 07:27:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:17,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:17,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:17,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:17,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:17,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:17,682 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:27:17,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13541 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:17,696 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:17,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:17,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:17,697 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:17,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:17,734 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:17,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:17,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:17,734 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:17,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:17,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,760 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:17,760 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:17,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:17,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:17,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:17,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:17,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:27:17,899 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:17,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:17,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:17,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-06 07:27:17,900 INFO L420 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -841683851, now seen corresponding path program 1 times [2022-12-06 07:27:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:17,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105244340] [2022-12-06 07:27:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:17,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:17,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:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105244340] [2022-12-06 07:27:17,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105244340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:17,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:17,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617635882] [2022-12-06 07:27:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:17,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:17,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:17,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:17,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:17,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:17,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:17,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,262 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:18,262 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:18,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:18,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:18,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:18,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:18,277 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:18,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:18,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,315 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:18,316 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:18,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,316 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,350 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:18,350 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:27:18,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:18,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:18,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:18,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:27:18,490 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:18,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:18,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-06 07:27:18,490 INFO L420 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 901126484, now seen corresponding path program 1 times [2022-12-06 07:27:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:18,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467341279] [2022-12-06 07:27:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:18,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:27:18,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:18,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467341279] [2022-12-06 07:27:18,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467341279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:18,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:18,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:18,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108955546] [2022-12-06 07:27:18,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:18,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:18,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:18,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:18,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:18,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:18,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:18,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:18,851 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:18,851 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:18,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:18,865 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:18,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:18,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:18,866 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:18,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:18,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:18,903 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:18,903 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:18,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:18,903 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:18,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:18,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,930 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:18,930 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:27:18,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:18,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:18,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:19,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:27:19,081 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:19,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2022-12-06 07:27:19,081 INFO L420 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1651030477, now seen corresponding path program 1 times [2022-12-06 07:27:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788078649] [2022-12-06 07:27:19,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788078649] [2022-12-06 07:27:19,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788078649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387860648] [2022-12-06 07:27:19,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:19,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:19,421 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:19,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:19,433 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:19,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:19,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:19,434 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:19,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:19,469 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:19,470 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:19,470 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:19,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:19,470 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:19,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:19,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:19,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:19,497 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:19,497 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:27:19,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:19,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:19,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:19,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:19,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:27:19,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:19,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-06 07:27:19,643 INFO L420 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 91779858, now seen corresponding path program 1 times [2022-12-06 07:27:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:19,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097628638] [2022-12-06 07:27:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:19,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:27:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:19,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097628638] [2022-12-06 07:27:19,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097628638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:19,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:19,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91203999] [2022-12-06 07:27:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:19,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:19,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:19,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:19,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:19,990 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:19,990 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:19,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:20,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:20,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:20,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:20,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:20,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:20,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:20,042 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:20,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,042 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,068 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:20,068 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:27:20,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:20,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:20,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:27:20,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:20,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-06 07:27:20,204 INFO L420 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1834590193, now seen corresponding path program 1 times [2022-12-06 07:27:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040979778] [2022-12-06 07:27:20,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:20,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040979778] [2022-12-06 07:27:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040979778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659499950] [2022-12-06 07:27:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:20,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:20,544 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:20,544 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:20,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:20,559 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:20,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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 69 transitions. [2022-12-06 07:27:20,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:20,560 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:20,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:20,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:20,599 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:20,599 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:20,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:20,599 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:20,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:20,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,625 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:20,626 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:20,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:20,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:20,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:20,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:27:20,762 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:20,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:20,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:20,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-06 07:27:20,762 INFO L420 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash -717566768, now seen corresponding path program 1 times [2022-12-06 07:27:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:20,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561911389] [2022-12-06 07:27:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:20,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:27:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561911389] [2022-12-06 07:27:20,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561911389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:20,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:20,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611999753] [2022-12-06 07:27:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:20,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:20,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:20,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:20,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:20,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,108 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:21,109 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:21,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:21,123 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:21,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:21,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:21,124 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:21,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:21,164 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:21,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,164 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,190 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:21,191 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:27:21,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:21,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:21,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:27:21,333 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:21,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-06 07:27:21,333 INFO L420 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:21,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1025243567, now seen corresponding path program 1 times [2022-12-06 07:27:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903640804] [2022-12-06 07:27:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:21,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:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:21,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903640804] [2022-12-06 07:27:21,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903640804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:21,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:21,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414307567] [2022-12-06 07:27:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:21,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:21,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:21,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:21,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:21,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:21,704 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:21,704 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:21,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:21,720 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:21,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:21,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:21,721 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:21,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:21,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:21,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:21,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:21,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:21,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:21,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:21,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,787 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:21,788 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:27:21,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:21,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:21,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:21,960 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:21,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:27:21,960 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:21,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:21,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:21,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-06 07:27:21,961 INFO L420 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1526913394, now seen corresponding path program 1 times [2022-12-06 07:27:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:21,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838383892] [2022-12-06 07:27:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,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:22,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838383892] [2022-12-06 07:27:22,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838383892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:22,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626731193] [2022-12-06 07:27:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:22,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:22,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:22,376 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:22,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:22,393 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:22,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:22,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:22,394 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:22,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:22,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:22,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:22,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:22,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:22,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:22,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:22,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:22,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:22,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:22,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:22,455 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:22,455 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:22,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:22,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:22,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:22,611 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:22,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:27:22,611 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:22,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:22,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:22,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-06 07:27:22,612 INFO L420 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash 215896941, now seen corresponding path program 1 times [2022-12-06 07:27:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:22,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308490245] [2022-12-06 07:27:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:22,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:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:22,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308490245] [2022-12-06 07:27:22,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308490245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:22,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:22,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617811929] [2022-12-06 07:27:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:22,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:22,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:22,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:22,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:22,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:22,992 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:22,992 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:22,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:23,007 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:23,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:23,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:23,008 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:23,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:23,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,043 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:23,044 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:23,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,044 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,069 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:23,069 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:23,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:23,214 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:23,215 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:23,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-06 07:27:23,215 INFO L420 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1958707276, now seen corresponding path program 1 times [2022-12-06 07:27:23,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409155157] [2022-12-06 07:27:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409155157] [2022-12-06 07:27:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409155157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310438092] [2022-12-06 07:27:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:23,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:23,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:23,567 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:23,567 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:23,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:23,580 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:23,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:23,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:23,581 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:23,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:23,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:23,618 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:23,619 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:23,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:23,619 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:23,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:23,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,645 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:23,645 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:23,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:23,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:23,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:23,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:23,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:27:23,804 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:23,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:23,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:23,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-06 07:27:23,804 INFO L420 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash -593449685, now seen corresponding path program 1 times [2022-12-06 07:27:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:23,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275805460] [2022-12-06 07:27:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:23,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:27:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:23,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275805460] [2022-12-06 07:27:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275805460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:23,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868202317] [2022-12-06 07:27:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:23,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:23,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:23,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:23,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:23,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,159 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:24,159 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:24,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:24,174 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:24,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:24,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:24,174 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:24,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:24,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,217 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:24,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:24,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,218 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,243 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:24,244 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:27:24,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:24,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:24,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 07:27:24,415 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:24,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2022-12-06 07:27:24,415 INFO L420 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1149360650, now seen corresponding path program 1 times [2022-12-06 07:27:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097022012] [2022-12-06 07:27:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:24,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:27:24,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:24,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097022012] [2022-12-06 07:27:24,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097022012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:24,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:24,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322877546] [2022-12-06 07:27:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:24,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:24,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:24,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:24,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:24,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:24,763 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:24,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:24,777 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:24,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:24,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:24,778 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:24,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:24,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:24,811 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:24,812 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:24,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:24,812 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:24,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:24,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,837 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:24,837 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:24,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:24,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:24,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:24,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:24,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:27:24,998 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:24,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:24,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2022-12-06 07:27:24,998 INFO L420 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:24,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1402796311, now seen corresponding path program 1 times [2022-12-06 07:27:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:24,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546150551] [2022-12-06 07:27:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546150551] [2022-12-06 07:27:25,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546150551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:25,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853836851] [2022-12-06 07:27:25,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:25,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:25,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,324 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:25,324 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:25,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:25,339 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:25,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:25,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:25,339 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:25,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:25,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,377 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:25,378 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:25,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,378 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,404 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:25,404 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:25,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:25,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:25,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:25,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:25,548 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:25,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:25,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:25,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2022-12-06 07:27:25,548 INFO L420 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash 340014024, now seen corresponding path program 1 times [2022-12-06 07:27:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:25,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314894230] [2022-12-06 07:27:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:25,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:27:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:25,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314894230] [2022-12-06 07:27:25,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314894230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:25,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:25,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513852786] [2022-12-06 07:27:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:25,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:25,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:25,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:25,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:25,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:25,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:25,898 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:25,898 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:25,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:25,912 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:25,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:25,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:25,913 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:25,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:25,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:25,950 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:25,950 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:25,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:25,950 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:25,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:25,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,975 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:25,976 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:27:25,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:25,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:25,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:26,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:27:26,123 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:26,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2022-12-06 07:27:26,123 INFO L420 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2082824359, now seen corresponding path program 1 times [2022-12-06 07:27:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942267283] [2022-12-06 07:27:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942267283] [2022-12-06 07:27:26,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942267283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864996553] [2022-12-06 07:27:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:26,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:26,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,450 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:26,450 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:26,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:26,465 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:26,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:26,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:26,466 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:26,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:26,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:26,502 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:26,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:26,503 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:26,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:26,503 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:26,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:26,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:26,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:26,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:26,528 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:26,528 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:27:26,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:26,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:26,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:26,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:26,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:27:26,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:26,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:26,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:26,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2022-12-06 07:27:26,666 INFO L420 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -469332602, now seen corresponding path program 1 times [2022-12-06 07:27:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:26,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472805501] [2022-12-06 07:27:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:26,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:27:26,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:26,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472805501] [2022-12-06 07:27:26,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472805501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:26,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:26,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:26,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522051064] [2022-12-06 07:27:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:26,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:26,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:26,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:26,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:26,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:26,998 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:26,998 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:27,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:27,011 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:27,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:27,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:27,012 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:27,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:27,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,047 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:27,047 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:27,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,072 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:27,072 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:27:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:27,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:27,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:27:27,205 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:27,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2022-12-06 07:27:27,205 INFO L420 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1273477733, now seen corresponding path program 1 times [2022-12-06 07:27:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706138056] [2022-12-06 07:27:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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:27:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706138056] [2022-12-06 07:27:27,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706138056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040341671] [2022-12-06 07:27:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:27,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:27,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:27,553 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:27,553 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:27,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:27,566 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:27,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:27,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:27,567 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:27,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:27,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:27,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:27,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:27,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:27,600 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:27,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:27,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,626 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:27,626 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:27:27,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:27,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:27,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:27,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:27,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:27,767 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:27,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:27,767 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:27,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2022-12-06 07:27:27,767 INFO L420 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:27,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1278679228, now seen corresponding path program 1 times [2022-12-06 07:27:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:27,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415171840] [2022-12-06 07:27:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:27,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:27,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:27:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:27,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415171840] [2022-12-06 07:27:27,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415171840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:27,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:27,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677348129] [2022-12-06 07:27:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:27,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:27,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:27,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:27,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:27,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:27,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,119 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:28,119 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:28,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:28,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:28,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:28,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:28,133 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:28,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:28,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,168 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:28,168 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:28,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,168 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,194 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:28,194 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 07:27:28,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3339/3551 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:28,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:28,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:27:28,332 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:28,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2022-12-06 07:27:28,332 INFO L420 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash 464131107, now seen corresponding path program 1 times [2022-12-06 07:27:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733104875] [2022-12-06 07:27:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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:27:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733104875] [2022-12-06 07:27:28,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733104875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376926100] [2022-12-06 07:27:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:28,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:28,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:28,668 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:28,668 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:28,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:28,682 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:28,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:28,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:28,682 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:28,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:28,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:28,718 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:28,718 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:28,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:28,718 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:28,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:28,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,743 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:28,743 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:27:28,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:28,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:28,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:28,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:28,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:27:28,895 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:28,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:28,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:28,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2022-12-06 07:27:28,895 INFO L420 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:28,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2088025854, now seen corresponding path program 1 times [2022-12-06 07:27:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:28,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996283750] [2022-12-06 07:27:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:28,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:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:28,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996283750] [2022-12-06 07:27:28,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996283750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:28,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:28,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659616411] [2022-12-06 07:27:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:28,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:28,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:28,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:28,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,224 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:29,224 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:29,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:29,238 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:29,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:29,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:29,239 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:29,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:29,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,276 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:29,277 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:29,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,277 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,301 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:29,302 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:27:29,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:29,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:29,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:29,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:27:29,446 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:29,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:29,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:29,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2022-12-06 07:27:29,446 INFO L420 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -345215519, now seen corresponding path program 1 times [2022-12-06 07:27:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297881973] [2022-12-06 07:27:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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:27:29,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297881973] [2022-12-06 07:27:29,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297881973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:29,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:29,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560819833] [2022-12-06 07:27:29,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:29,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:29,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:29,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:29,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:29,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:29,786 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:29,786 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:29,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:29,800 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:29,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:29,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:29,801 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:29,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:29,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:29,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:29,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:29,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:29,838 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:29,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:29,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,863 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:29,864 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:29,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:29,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:29,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:30,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:27:30,016 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:30,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2022-12-06 07:27:30,016 INFO L420 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1397594816, now seen corresponding path program 1 times [2022-12-06 07:27:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114813798] [2022-12-06 07:27:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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:27:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114813798] [2022-12-06 07:27:30,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114813798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872503577] [2022-12-06 07:27:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:30,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:30,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:30,374 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:30,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:30,388 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:30,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:30,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:30,389 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:30,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:30,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:30,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:30,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,460 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:30,460 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:27:30,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:30,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:30,596 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:30,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:27:30,596 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:30,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:30,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:30,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2022-12-06 07:27:30,596 INFO L420 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1154562145, now seen corresponding path program 1 times [2022-12-06 07:27:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:30,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185302031] [2022-12-06 07:27:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:30,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:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185302031] [2022-12-06 07:27:30,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185302031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:30,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:30,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241799526] [2022-12-06 07:27:30,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:30,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:30,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:30,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:30,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:30,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:30,945 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:30,945 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:30,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:30,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:30,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:30,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:30,961 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:30,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:30,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:30,998 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:30,998 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:30,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:30,998 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:30,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:30,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:30,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,024 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:31,025 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:27:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:31,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:31,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:27:31,172 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:31,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2022-12-06 07:27:31,172 INFO L420 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 588248190, now seen corresponding path program 1 times [2022-12-06 07:27:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087306697] [2022-12-06 07:27:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087306697] [2022-12-06 07:27:31,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087306697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254475566] [2022-12-06 07:27:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:31,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:31,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:31,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:31,511 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:27:31,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:31,524 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:31,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:31,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:31,525 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:31,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:31,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:31,558 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:31,558 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:31,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:31,558 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:31,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:31,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,591 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:31,591 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:27:31,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:31,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:31,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:31,728 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:31,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:31,729 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:31,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,729 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:31,729 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:31,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2022-12-06 07:27:31,729 INFO L420 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1963908771, now seen corresponding path program 1 times [2022-12-06 07:27:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:31,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347494969] [2022-12-06 07:27:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:31,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:27:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347494969] [2022-12-06 07:27:31,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347494969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:31,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:31,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98183186] [2022-12-06 07:27:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:31,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:31,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:31,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:31,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:31,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,066 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:32,066 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:27:32,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:32,080 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:32,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:32,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:32,081 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:32,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:32,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,117 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:32,117 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:32,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,118 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,143 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:32,143 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:32,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:32,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:27:32,303 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:32,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2022-12-06 07:27:32,303 INFO L420 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -221098436, now seen corresponding path program 1 times [2022-12-06 07:27:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870611822] [2022-12-06 07:27:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:32,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:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870611822] [2022-12-06 07:27:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870611822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559205666] [2022-12-06 07:27:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:32,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:32,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:32,630 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:32,630 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:32,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:32,644 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:32,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:32,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:32,645 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:32,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:32,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:32,680 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:32,680 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:32,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:32,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:32,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:32,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,706 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:32,706 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:27:32,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:32,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:32,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:32,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:32,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:27:32,872 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:32,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:32,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:32,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2022-12-06 07:27:32,873 INFO L420 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1521711899, now seen corresponding path program 1 times [2022-12-06 07:27:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:32,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142908257] [2022-12-06 07:27:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:32,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:27:32,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:32,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142908257] [2022-12-06 07:27:32,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142908257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:32,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:32,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371225870] [2022-12-06 07:27:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:32,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:32,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:32,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:32,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,239 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:33,239 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:33,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:33,252 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:33,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:33,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:33,253 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:33,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:33,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,289 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:33,289 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:33,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,289 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,315 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:33,315 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:27:33,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:33,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:33,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:33,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:27:33,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:33,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:33,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:33,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2022-12-06 07:27:33,458 INFO L420 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1030445062, now seen corresponding path program 1 times [2022-12-06 07:27:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:33,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398197147] [2022-12-06 07:27:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:33,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:27:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:33,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398197147] [2022-12-06 07:27:33,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398197147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:33,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:33,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550592487] [2022-12-06 07:27:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:33,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:33,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:33,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:33,805 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:33,805 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:33,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:33,817 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:33,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:33,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:33,818 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:33,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:33,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:33,856 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:33,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:33,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:33,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:33,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:33,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,883 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:33,883 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:33,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:33,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:33,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:34,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:34,026 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:34,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2022-12-06 07:27:34,026 INFO L420 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:34,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 712365273, now seen corresponding path program 1 times [2022-12-06 07:27:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582703541] [2022-12-06 07:27:34,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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:34,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582703541] [2022-12-06 07:27:34,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582703541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817359170] [2022-12-06 07:27:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:34,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:34,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,364 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:34,364 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:34,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:34,378 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:34,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:34,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:34,378 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:34,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:34,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,413 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:34,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:34,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,413 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,439 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:34,439 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:34,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:34,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:34,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:34,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:27:34,596 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:34,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:34,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:34,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2022-12-06 07:27:34,596 INFO L420 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1839791688, now seen corresponding path program 1 times [2022-12-06 07:27:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908946135] [2022-12-06 07:27:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:34,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:27:34,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:34,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908946135] [2022-12-06 07:27:34,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908946135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:34,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:34,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605174331] [2022-12-06 07:27:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:34,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:34,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:34,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:34,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:34,928 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:34,928 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:34,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:34,943 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:34,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:34,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:34,944 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:34,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:34,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:34,981 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:34,982 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:34,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:34,982 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:34,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:34,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:34,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,007 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:35,008 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:27:35,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:35,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:35,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:35,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2022-12-06 07:27:35,152 INFO L420 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -96981353, now seen corresponding path program 1 times [2022-12-06 07:27:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880316618] [2022-12-06 07:27:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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:27:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880316618] [2022-12-06 07:27:35,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880316618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182478607] [2022-12-06 07:27:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:35,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:35,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:35,473 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:35,473 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:35,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:35,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:35,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:35,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:35,487 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:35,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:35,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:35,524 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:35,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:35,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:35,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:35,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:35,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,549 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:35,549 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:35,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:35,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:35,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:35,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:35,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:27:35,697 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:35,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:35,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:35,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2022-12-06 07:27:35,697 INFO L420 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1645828982, now seen corresponding path program 1 times [2022-12-06 07:27:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:35,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893389079] [2022-12-06 07:27:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:35,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:27:35,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893389079] [2022-12-06 07:27:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893389079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:35,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:35,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:35,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137615746] [2022-12-06 07:27:35,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:35,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:35,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:35,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:35,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:35,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:35,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:35,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,011 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:36,011 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:36,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:36,023 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:36,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:36,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:36,024 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:36,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:36,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,058 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:36,058 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:36,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,058 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,084 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:36,084 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:27:36,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:36,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:36,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:36,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:36,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2022-12-06 07:27:36,229 INFO L420 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,230 INFO L85 PathProgramCache]: Analyzing trace with hash -906327979, now seen corresponding path program 1 times [2022-12-06 07:27:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377628454] [2022-12-06 07:27:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,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:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377628454] [2022-12-06 07:27:36,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377628454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169439737] [2022-12-06 07:27:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:36,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:36,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:36,559 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:36,559 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:36,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:36,572 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:36,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:36,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:36,574 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:36,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:36,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:36,610 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:36,611 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:36,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:36,611 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:36,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:36,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,637 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:36,637 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:36,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:36,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:36,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:36,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:36,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:27:36,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:36,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:36,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:36,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2022-12-06 07:27:36,796 INFO L420 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash 836482356, now seen corresponding path program 1 times [2022-12-06 07:27:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:36,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891213383] [2022-12-06 07:27:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:36,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891213383] [2022-12-06 07:27:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891213383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:36,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:36,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27813117] [2022-12-06 07:27:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:36,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:36,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:36,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:36,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:36,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:36,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,149 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:37,150 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:27:37,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:37,163 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:37,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:37,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:37,163 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:37,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:37,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,200 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:37,200 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:37,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,200 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,227 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:37,228 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:27:37,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:37,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:37,377 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:27:37,377 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:37,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2022-12-06 07:27:37,377 INFO L420 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1715674605, now seen corresponding path program 1 times [2022-12-06 07:27:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476763727] [2022-12-06 07:27:37,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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:27:37,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476763727] [2022-12-06 07:27:37,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476763727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272698289] [2022-12-06 07:27:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:37,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:37,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:37,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:37,734 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:37,734 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:37,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:37,748 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:37,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:37,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:37,749 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:37,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:37,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:37,786 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:37,787 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:37,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:37,787 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:37,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:37,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,813 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:37,814 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:27:37,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:37,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:37,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:37,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:37,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 07:27:37,941 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:37,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:37,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:37,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2022-12-06 07:27:37,941 INFO L420 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash 27135730, now seen corresponding path program 1 times [2022-12-06 07:27:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:37,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864769012] [2022-12-06 07:27:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:37,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:27:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:37,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864769012] [2022-12-06 07:27:37,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864769012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:37,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:37,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496587042] [2022-12-06 07:27:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:37,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:37,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:37,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:38,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,283 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:38,283 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:38,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:38,296 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:38,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:38,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:38,297 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:38,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:38,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,333 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:38,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:38,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,334 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,361 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:38,362 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:27:38,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:38,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:38,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:38,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:27:38,499 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:38,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:38,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:38,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2022-12-06 07:27:38,500 INFO L420 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1769946065, now seen corresponding path program 1 times [2022-12-06 07:27:38,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:38,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068133114] [2022-12-06 07:27:38,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:38,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:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068133114] [2022-12-06 07:27:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068133114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:38,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:38,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143413913] [2022-12-06 07:27:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:38,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:38,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:38,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:38,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:38,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:38,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:38,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:38,831 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:38,832 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:38,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:38,847 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:38,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:38,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:38,848 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:38,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:38,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:38,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:38,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:38,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:38,884 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:38,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:38,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,909 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:38,909 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:38,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:38,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:38,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:39,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:39,051 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:39,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2022-12-06 07:27:39,052 INFO L420 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -782210896, now seen corresponding path program 1 times [2022-12-06 07:27:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093186863] [2022-12-06 07:27:39,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093186863] [2022-12-06 07:27:39,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093186863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175579153] [2022-12-06 07:27:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:39,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:39,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,449 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:39,449 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:39,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:39,462 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:39,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:39,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:39,462 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:39,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:39,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:39,496 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:39,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:39,497 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:39,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:39,497 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:39,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:39,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:39,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:39,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:39,522 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:39,522 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:27:39,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:39,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:39,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:39,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:39,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:27:39,665 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:39,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:39,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:39,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2022-12-06 07:27:39,665 INFO L420 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:39,665 INFO L85 PathProgramCache]: Analyzing trace with hash 960599439, now seen corresponding path program 1 times [2022-12-06 07:27:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:39,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999193399] [2022-12-06 07:27:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:39,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:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:39,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999193399] [2022-12-06 07:27:39,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999193399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:39,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:39,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188377359] [2022-12-06 07:27:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:39,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:39,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:39,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:39,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:39,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:39,990 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:39,990 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:39,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:40,003 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:40,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:40,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:40,004 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:40,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:40,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,041 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:40,041 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:40,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,041 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,067 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:40,067 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:27:40,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:40,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:40,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:40,212 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:40,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,212 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2022-12-06 07:27:40,213 INFO L420 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1591557522, now seen corresponding path program 1 times [2022-12-06 07:27:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251811724] [2022-12-06 07:27:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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:27:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251811724] [2022-12-06 07:27:40,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251811724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57793196] [2022-12-06 07:27:40,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:40,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:40,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:40,546 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:40,546 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:40,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:40,562 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:40,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:40,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:40,563 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:40,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:40,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:40,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:40,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:40,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:40,600 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:40,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:40,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,629 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:40,629 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:27:40,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:40,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:40,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:40,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:40,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:27:40,774 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:40,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:40,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:40,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2022-12-06 07:27:40,774 INFO L420 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 151252813, now seen corresponding path program 1 times [2022-12-06 07:27:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:40,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501147323] [2022-12-06 07:27:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:40,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:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501147323] [2022-12-06 07:27:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501147323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:40,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:40,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314164083] [2022-12-06 07:27:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:40,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:40,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:40,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:40,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,113 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:41,114 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:41,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:41,127 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:41,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:41,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:41,127 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:41,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:41,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,160 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,160 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:41,161 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:41,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,161 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,186 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:41,187 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:41,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:41,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:41,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:27:41,336 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:41,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2022-12-06 07:27:41,337 INFO L420 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1894063148, now seen corresponding path program 1 times [2022-12-06 07:27:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113347585] [2022-12-06 07:27:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113347585] [2022-12-06 07:27:41,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113347585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628853164] [2022-12-06 07:27:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:41,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:41,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:41,687 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:41,687 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:41,700 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:41,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:41,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:41,701 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:41,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:41,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:41,735 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:41,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:41,735 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:41,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:41,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,760 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:41,761 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:41,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:41,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:41,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:41,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:41,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:27:41,914 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:41,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:41,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:41,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2022-12-06 07:27:41,914 INFO L420 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -658093813, now seen corresponding path program 1 times [2022-12-06 07:27:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:41,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938603708] [2022-12-06 07:27:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:41,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:27:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:41,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938603708] [2022-12-06 07:27:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938603708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:41,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720003461] [2022-12-06 07:27:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:41,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:41,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:41,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:41,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:41,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:41,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,274 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:42,274 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:42,287 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:42,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:42,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:42,288 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:42,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:42,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:42,322 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:42,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:42,348 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:27:42,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:42,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:42,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:42,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:27:42,505 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:42,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:42,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2022-12-06 07:27:42,505 INFO L420 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1084716522, now seen corresponding path program 1 times [2022-12-06 07:27:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:42,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294222550] [2022-12-06 07:27:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294222550] [2022-12-06 07:27:42,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294222550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:42,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:42,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901107900] [2022-12-06 07:27:42,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:42,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:42,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:42,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:42,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:42,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:42,864 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:42,865 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:42,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:42,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:42,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:42,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:42,884 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:42,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:42,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:42,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:42,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:42,929 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:42,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:42,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,954 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:42,954 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:42,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:42,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:42,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:43,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:43,098 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:43,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2022-12-06 07:27:43,098 INFO L420 AbstractCegarLoop]: === Iteration 244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1467440439, now seen corresponding path program 1 times [2022-12-06 07:27:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590216970] [2022-12-06 07:27:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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:27:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590216970] [2022-12-06 07:27:43,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590216970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354182443] [2022-12-06 07:27:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:43,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:43,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:43,441 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:43,442 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:43,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:43,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:43,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:43,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:43,456 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:43,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:43,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:43,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:43,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:43,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:43,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:43,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:43,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:43,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:43,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:43,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:43,516 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:43,516 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:27:43,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:43,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:43,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:43,669 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:43,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:27:43,670 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:43,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:43,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:43,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2022-12-06 07:27:43,670 INFO L420 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash 275369896, now seen corresponding path program 1 times [2022-12-06 07:27:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:43,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209652719] [2022-12-06 07:27:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:43,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:43,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:27:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:43,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209652719] [2022-12-06 07:27:43,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209652719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:43,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:43,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284865416] [2022-12-06 07:27:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:43,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:43,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:43,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:43,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:43,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,012 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:44,012 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:44,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:44,025 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:44,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:44,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:44,026 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:44,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,059 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:44,060 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:44,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,060 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,085 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:44,085 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:27:44,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:44,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:44,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:44,227 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:44,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2022-12-06 07:27:44,228 INFO L420 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2018180231, now seen corresponding path program 1 times [2022-12-06 07:27:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169178078] [2022-12-06 07:27:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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:44,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169178078] [2022-12-06 07:27:44,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169178078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545882708] [2022-12-06 07:27:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:44,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:44,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:44,570 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:44,571 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:44,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:44,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:44,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:44,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:44,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:44,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:44,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:44,619 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,619 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:44,619 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:44,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:44,619 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:44,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,644 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:44,644 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:44,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:44,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:44,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:44,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:44,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:27:44,782 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:44,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:44,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:44,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2022-12-06 07:27:44,782 INFO L420 AbstractCegarLoop]: === Iteration 247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash -533976730, now seen corresponding path program 1 times [2022-12-06 07:27:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:44,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075187486] [2022-12-06 07:27:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:44,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:27:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:44,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075187486] [2022-12-06 07:27:44,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075187486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:44,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:44,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500975749] [2022-12-06 07:27:44,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:44,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:44,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:44,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:44,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:44,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:44,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:44,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,125 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:45,125 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:45,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:45,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:45,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:45,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:45,140 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:45,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:45,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,178 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:45,178 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:45,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,178 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,203 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:45,203 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:45,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:45,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:45,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:45,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:45,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2022-12-06 07:27:45,348 INFO L420 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1208833605, now seen corresponding path program 1 times [2022-12-06 07:27:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968256844] [2022-12-06 07:27:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,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:45,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968256844] [2022-12-06 07:27:45,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968256844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763991510] [2022-12-06 07:27:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:45,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:45,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:45,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:45,674 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:45,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:45,688 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:45,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:45,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:45,689 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:45,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:45,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:45,725 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:45,726 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:45,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:45,726 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:45,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:45,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,751 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:45,752 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:45,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:45,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:45,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:45,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:45,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:45,893 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:45,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:45,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2022-12-06 07:27:45,894 INFO L420 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1343323356, now seen corresponding path program 1 times [2022-12-06 07:27:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:45,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834095821] [2022-12-06 07:27:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:45,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:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:45,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834095821] [2022-12-06 07:27:45,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834095821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:45,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:45,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794758085] [2022-12-06 07:27:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:45,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:45,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:45,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:45,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:45,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,220 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:46,220 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:46,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:46,233 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:46,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:46,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:46,234 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:46,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:46,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,270 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:46,270 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:46,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,270 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,295 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:46,295 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:27:46,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:46,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:46,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:46,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:27:46,432 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:46,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:46,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2022-12-06 07:27:46,433 INFO L420 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash 399486979, now seen corresponding path program 1 times [2022-12-06 07:27:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:46,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206820264] [2022-12-06 07:27:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:46,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:27:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:46,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206820264] [2022-12-06 07:27:46,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206820264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:46,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:46,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52969645] [2022-12-06 07:27:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:46,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:46,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:46,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:46,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:46,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:46,773 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:46,773 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:46,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:46,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:46,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:46,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:46,787 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:46,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:46,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:46,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:46,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:46,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:46,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:46,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:46,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,848 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:46,848 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:27:46,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:46,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:46,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:47,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:27:47,003 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:47,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2022-12-06 07:27:47,003 INFO L420 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2142297314, now seen corresponding path program 1 times [2022-12-06 07:27:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288767252] [2022-12-06 07:27:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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:27:47,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288767252] [2022-12-06 07:27:47,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288767252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169722286] [2022-12-06 07:27:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:47,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:47,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,347 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:47,347 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:47,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:47,360 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:47,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:47,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:47,361 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:47,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:47,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,395 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:47,395 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:47,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,395 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,420 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:47,420 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:47,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:47,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:47,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:47,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:27:47,576 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:47,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:47,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:47,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2022-12-06 07:27:47,577 INFO L420 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash -409859647, now seen corresponding path program 1 times [2022-12-06 07:27:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:47,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712606935] [2022-12-06 07:27:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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:27:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:47,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712606935] [2022-12-06 07:27:47,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712606935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:47,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:47,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:47,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841807535] [2022-12-06 07:27:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:47,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:47,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:47,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:47,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:47,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:47,909 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:47,909 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:27:47,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:47,922 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:47,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:47,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:47,923 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:47,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:47,957 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:47,957 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:47,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:47,957 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:47,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:47,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,982 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:47,982 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:27:47,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:47,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:47,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:48,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:48,128 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:48,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2022-12-06 07:27:48,128 INFO L420 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1332950688, now seen corresponding path program 1 times [2022-12-06 07:27:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130128838] [2022-12-06 07:27:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130128838] [2022-12-06 07:27:48,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130128838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:48,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385826307] [2022-12-06 07:27:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:48,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:48,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:48,476 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:48,476 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:48,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:48,490 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:48,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:48,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:48,491 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:48,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:48,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:48,528 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:48,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:48,529 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:48,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:48,529 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:48,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:48,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:48,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:48,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:48,554 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:48,554 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 07:27:48,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3174/3317 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:48,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:48,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:48,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:48,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:27:48,705 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:48,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:48,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:48,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2022-12-06 07:27:48,705 INFO L420 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1219206273, now seen corresponding path program 1 times [2022-12-06 07:27:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:48,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604554129] [2022-12-06 07:27:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:48,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:27:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:48,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604554129] [2022-12-06 07:27:48,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604554129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:48,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:48,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69458182] [2022-12-06 07:27:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:48,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:48,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:48,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:48,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:48,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:49,048 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:49,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:49,062 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:49,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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 69 transitions. [2022-12-06 07:27:49,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:49,063 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:49,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:49,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,100 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:49,101 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:49,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,101 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,126 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:49,127 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:49,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:49,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:49,266 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:27:49,266 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:49,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2022-12-06 07:27:49,267 INFO L420 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash 523604062, now seen corresponding path program 1 times [2022-12-06 07:27:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239476870] [2022-12-06 07:27:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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:27:49,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239476870] [2022-12-06 07:27:49,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239476870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:49,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31935609] [2022-12-06 07:27:49,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:49,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:49,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:49,611 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:49,611 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:49,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:49,624 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:49,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:49,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:49,625 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:49,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:49,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:49,658 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:49,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:49,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:49,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:49,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:49,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,683 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:49,684 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:27:49,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:49,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:49,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:49,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:49,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:27:49,820 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:49,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,821 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2022-12-06 07:27:49,821 INFO L420 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2028552899, now seen corresponding path program 1 times [2022-12-06 07:27:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529477693] [2022-12-06 07:27:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:49,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:27:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:49,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529477693] [2022-12-06 07:27:49,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529477693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:49,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:49,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081802368] [2022-12-06 07:27:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:49,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:49,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:49,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:49,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:49,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:49,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:49,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:49,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,142 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:50,142 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:50,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:50,155 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:50,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:50,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:50,156 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:50,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:50,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,189 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:50,190 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:50,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,190 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,215 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:50,215 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:27:50,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:50,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:50,355 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:27:50,356 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:50,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2022-12-06 07:27:50,356 INFO L420 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -285742564, now seen corresponding path program 1 times [2022-12-06 07:27:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750788580] [2022-12-06 07:27:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,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:27:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750788580] [2022-12-06 07:27:50,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750788580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319973296] [2022-12-06 07:27:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:50,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:50,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,710 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:50,711 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:27:50,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:50,723 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:50,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:50,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:50,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:50,724 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:50,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:50,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:50,757 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:50,757 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:50,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,757 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,782 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:50,783 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:27:50,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:50,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:50,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:50,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:50,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:27:50,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:50,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2022-12-06 07:27:50,935 INFO L420 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1457067771, now seen corresponding path program 1 times [2022-12-06 07:27:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769487877] [2022-12-06 07:27:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,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:27:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769487877] [2022-12-06 07:27:50,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769487877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522643594] [2022-12-06 07:27:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:50,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:50,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,260 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:51,261 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:27:51,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:51,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:51,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:51,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:51,275 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:51,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:51,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:51,314 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:51,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,315 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,341 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:51,341 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:27:51,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:51,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:51,483 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:27:51,484 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:51,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2022-12-06 07:27:51,484 INFO L420 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1095089190, now seen corresponding path program 1 times [2022-12-06 07:27:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512868615] [2022-12-06 07:27:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:51,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:27:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512868615] [2022-12-06 07:27:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512868615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:51,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:51,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322569378] [2022-12-06 07:27:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:51,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:51,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:51,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:51,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:51,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:51,866 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:51,866 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:27:51,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:51,881 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:51,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:51,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:51,882 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:51,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:51,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:51,920 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:51,920 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:51,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:51,920 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:51,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:51,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,946 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:51,946 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:51,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:51,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:51,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:52,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 07:27:52,117 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:52,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2022-12-06 07:27:52,118 INFO L420 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash 647721145, now seen corresponding path program 1 times [2022-12-06 07:27:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152870526] [2022-12-06 07:27:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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:27:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152870526] [2022-12-06 07:27:52,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152870526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313364446] [2022-12-06 07:27:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:52,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:52,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:52,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:52,496 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:27:52,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:52,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:52,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:52,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:52,514 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:52,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:52,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:52,548 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:52,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:52,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:52,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:52,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:52,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:52,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:52,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:52,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:52,573 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:52,574 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:27:52,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:52,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:52,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:52,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:52,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:27:52,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:52,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:52,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:52,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2022-12-06 07:27:52,732 INFO L420 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1904435816, now seen corresponding path program 1 times [2022-12-06 07:27:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439505206] [2022-12-06 07:27:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,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:27:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439505206] [2022-12-06 07:27:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439505206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:52,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:52,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840009735] [2022-12-06 07:27:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:52,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:52,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:52,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:52,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:52,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:52,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,079 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:53,079 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:53,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:53,091 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:53,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:53,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:53,092 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:53,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:53,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,126 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:53,126 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:53,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,126 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,127 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,151 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:53,151 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:27:53,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:53,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:53,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:27:53,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2022-12-06 07:27:53,297 INFO L420 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -161625481, now seen corresponding path program 1 times [2022-12-06 07:27:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989952505] [2022-12-06 07:27:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,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:27:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989952505] [2022-12-06 07:27:53,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989952505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728899661] [2022-12-06 07:27:53,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:53,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:53,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:53,633 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:53,633 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:53,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:53,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:53,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:53,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:53,647 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:53,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:53,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:53,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:53,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:53,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:53,682 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:53,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:53,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,707 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:53,707 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:53,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:53,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:53,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:53,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:53,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:27:53,851 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:53,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:53,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2022-12-06 07:27:53,852 INFO L420 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1581184854, now seen corresponding path program 1 times [2022-12-06 07:27:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:53,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664817730] [2022-12-06 07:27:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:53,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:53,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664817730] [2022-12-06 07:27:53,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664817730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:53,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:53,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:53,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489034850] [2022-12-06 07:27:53,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:53,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:53,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:53,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:53,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:53,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:53,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:53,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:53,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,213 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:54,213 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:54,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:54,229 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:54,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:54,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:54,230 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:54,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:54,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,276 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:54,277 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:54,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,277 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,304 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:54,304 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:54,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:54,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:54,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:27:54,446 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:54,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:54,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2022-12-06 07:27:54,447 INFO L420 AbstractCegarLoop]: === Iteration 264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -970972107, now seen corresponding path program 1 times [2022-12-06 07:27:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:54,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853277082] [2022-12-06 07:27:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:54,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:54,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:54,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853277082] [2022-12-06 07:27:54,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853277082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:54,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:54,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97779444] [2022-12-06 07:27:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:54,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:54,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:54,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:54,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:54,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:54,793 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:54,793 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:27:54,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:54,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:54,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:54,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:54,807 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:54,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:54,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:54,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:54,844 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:54,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:54,844 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:54,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:54,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,869 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:54,870 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:54,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:54,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:54,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:55,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:27:55,027 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:55,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,027 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2022-12-06 07:27:55,027 INFO L420 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 771838228, now seen corresponding path program 1 times [2022-12-06 07:27:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200265770] [2022-12-06 07:27:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,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:27:55,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200265770] [2022-12-06 07:27:55,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200265770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85496748] [2022-12-06 07:27:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:55,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:55,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,377 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:55,377 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:27:55,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:55,390 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:55,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:55,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:55,391 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:55,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:55,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,428 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:55,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:55,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,454 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:55,454 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:27:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:55,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:55,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:55,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 07:27:55,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:55,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:55,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2022-12-06 07:27:55,624 INFO L420 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1780318733, now seen corresponding path program 1 times [2022-12-06 07:27:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:55,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752173922] [2022-12-06 07:27:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:55,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752173922] [2022-12-06 07:27:55,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752173922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:55,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:55,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622755654] [2022-12-06 07:27:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:55,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:55,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:55,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:55,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:55,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:55,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:55,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:55,946 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:27:55,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:55,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:55,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:55,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:55,962 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:55,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:55,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:55,996 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:55,996 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:55,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:55,996 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:55,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:55,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:55,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,021 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:56,021 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:56,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:56,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:27:56,163 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:56,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2022-12-06 07:27:56,164 INFO L420 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -37508398, now seen corresponding path program 1 times [2022-12-06 07:27:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144271784] [2022-12-06 07:27:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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:27:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144271784] [2022-12-06 07:27:56,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144271784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075523103] [2022-12-06 07:27:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:56,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:56,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:56,513 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:56,513 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:56,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:56,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:56,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:56,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:56,526 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:56,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:56,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:56,560 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:56,560 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:56,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:56,560 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:56,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:56,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,586 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:56,586 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:27:56,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:56,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:56,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:56,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:56,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:27:56,726 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:56,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:56,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:56,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2022-12-06 07:27:56,726 INFO L420 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1705301937, now seen corresponding path program 1 times [2022-12-06 07:27:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:56,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984177187] [2022-12-06 07:27:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:56,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:27:56,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:56,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984177187] [2022-12-06 07:27:56,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984177187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:56,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:56,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891897107] [2022-12-06 07:27:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:56,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:56,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:56,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:56,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:56,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:57,056 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:27:57,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:57,069 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:57,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:57,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:57,070 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:57,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:57,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:57,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:57,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,131 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:57,131 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:27:57,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:57,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:57,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:27:57,280 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:57,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2022-12-06 07:27:57,280 INFO L420 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash -846855024, now seen corresponding path program 1 times [2022-12-06 07:27:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193370827] [2022-12-06 07:27:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193370827] [2022-12-06 07:27:57,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193370827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356530375] [2022-12-06 07:27:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:57,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:57,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:57,635 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:57,635 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:27:57,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:57,648 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:57,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:57,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:57,649 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:57,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:57,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:57,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:57,682 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:57,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:57,682 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:57,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:57,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,707 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:57,707 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:27:57,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:57,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:57,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:57,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:57,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:27:57,862 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:57,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:57,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2022-12-06 07:27:57,862 INFO L420 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash 895955311, now seen corresponding path program 1 times [2022-12-06 07:27:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119950183] [2022-12-06 07:27:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:57,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:27:57,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:57,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119950183] [2022-12-06 07:27:57,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119950183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:57,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880103976] [2022-12-06 07:27:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:57,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:57,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:57,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:57,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:57,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:58,190 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:58,190 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:27:58,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:58,204 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:58,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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 69 transitions. [2022-12-06 07:27:58,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:58,205 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:58,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:58,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:58,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:58,242 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:58,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:58,242 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:58,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:58,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,268 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:58,269 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:27:58,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:58,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:58,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:58,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:27:58,422 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:58,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:58,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:58,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2022-12-06 07:27:58,422 INFO L420 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1656201650, now seen corresponding path program 1 times [2022-12-06 07:27:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194611950] [2022-12-06 07:27:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:58,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:27:58,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194611950] [2022-12-06 07:27:58,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194611950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:58,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:58,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601471404] [2022-12-06 07:27:58,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:58,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:58,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:58,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:58,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:58,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:58,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:58,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:58,771 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:58,771 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:58,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:58,785 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:58,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:58,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:58,786 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:58,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:58,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:58,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:58,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:58,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:58,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:58,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:58,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,849 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:58,849 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:27:58,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:58,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:58,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:59,003 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:27:59,004 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:59,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2022-12-06 07:27:59,004 INFO L420 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash 86608685, now seen corresponding path program 1 times [2022-12-06 07:27:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876769706] [2022-12-06 07:27:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27: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:27:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876769706] [2022-12-06 07:27:59,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876769706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120649613] [2022-12-06 07:27:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:59,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,360 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:59,361 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:27:59,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:59,375 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:59,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:59,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:59,376 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:59,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:59,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,413 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:59,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:59,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,413 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,413 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,440 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:27:59,440 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:27:59,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:27:59,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:27:59,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:59,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:27:59,578 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:27:59,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:59,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:59,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2022-12-06 07:27:59,578 INFO L420 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1829419020, now seen corresponding path program 1 times [2022-12-06 07:27:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:59,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140327462] [2022-12-06 07:27:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:59,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:27:59,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:59,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140327462] [2022-12-06 07:27:59,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140327462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:59,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:59,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:27:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348067575] [2022-12-06 07:27:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:59,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:59,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:27:59,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:59,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:27:59,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:59,910 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:27:59,910 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:27:59,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:27:59,923 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:27:59,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:27:59,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:27:59,924 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:27:59,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:27:59,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:27:59,960 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:27:59,960 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:27:59,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:59,960 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:59,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:59,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,986 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:27:59,986 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:27:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2957 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:27:59,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:27:59,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:00,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:00,129 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:00,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2022-12-06 07:28:00,129 INFO L420 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash -722737941, now seen corresponding path program 1 times [2022-12-06 07:28:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065187847] [2022-12-06 07:28:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,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:00,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065187847] [2022-12-06 07:28:00,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065187847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073285364] [2022-12-06 07:28:00,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:00,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:00,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:00,457 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:00,457 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:28:00,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:00,471 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:00,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:00,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:00,472 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:00,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:00,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:00,507 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:00,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:00,508 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:00,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:00,508 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:00,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:00,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:00,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:00,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:00,533 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:00,533 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:00,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:00,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:00,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:00,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:00,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:28:00,689 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:00,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:00,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:00,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2022-12-06 07:28:00,689 INFO L420 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1020072394, now seen corresponding path program 1 times [2022-12-06 07:28:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:00,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433027015] [2022-12-06 07:28:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:00,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433027015] [2022-12-06 07:28:00,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433027015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:00,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:00,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615322203] [2022-12-06 07:28:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:00,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:00,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:00,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:00,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:00,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,019 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:01,019 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:01,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:01,032 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:01,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:01,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:01,032 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:01,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:01,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,066 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:01,066 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:01,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,067 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,092 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:01,092 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:28:01,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:01,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:01,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:28:01,240 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:01,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2022-12-06 07:28:01,240 INFO L420 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1532084567, now seen corresponding path program 1 times [2022-12-06 07:28:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95829745] [2022-12-06 07:28:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,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:28:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95829745] [2022-12-06 07:28:01,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95829745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629081398] [2022-12-06 07:28:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:01,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:01,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:01,572 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:01,572 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:01,586 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:01,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:01,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:01,587 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:01,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:01,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:01,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:01,623 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:01,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:01,623 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:01,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:01,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,648 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:01,648 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:01,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:01,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:01,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:01,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:01,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:01,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:01,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:01,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:01,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2022-12-06 07:28:01,788 INFO L420 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash 210725768, now seen corresponding path program 1 times [2022-12-06 07:28:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:01,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395028089] [2022-12-06 07:28:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:01,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395028089] [2022-12-06 07:28:01,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395028089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:01,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:01,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534401322] [2022-12-06 07:28:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:01,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:01,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:01,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,131 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:02,132 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:02,145 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:02,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:02,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:02,146 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:02,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:02,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,185 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:02,185 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:02,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,186 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,210 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:02,211 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:28:02,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:02,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:02,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:28:02,363 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:02,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2022-12-06 07:28:02,363 INFO L420 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1953536103, now seen corresponding path program 1 times [2022-12-06 07:28:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379931796] [2022-12-06 07:28:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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:28:02,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379931796] [2022-12-06 07:28:02,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379931796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727247048] [2022-12-06 07:28:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:02,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:02,699 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:02,699 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:02,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:02,713 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:02,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:02,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:02,714 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:02,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:02,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:02,752 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:02,752 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:02,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:02,752 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:02,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:02,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,777 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:02,778 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:02,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:02,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:02,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:02,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:02,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:28:02,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:02,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:02,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:02,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2022-12-06 07:28:02,936 INFO L420 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -598620858, now seen corresponding path program 1 times [2022-12-06 07:28:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997075338] [2022-12-06 07:28:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:02,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997075338] [2022-12-06 07:28:02,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997075338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:02,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:02,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:02,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081752264] [2022-12-06 07:28:02,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:02,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:02,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:02,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:02,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:02,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:02,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:02,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,286 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:03,286 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:03,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:03,301 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:03,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:03,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:03,301 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:03,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,339 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:03,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:03,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,339 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,366 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:03,366 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:03,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:03,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:03,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:28:03,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:03,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2022-12-06 07:28:03,524 INFO L420 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1144189477, now seen corresponding path program 1 times [2022-12-06 07:28:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458152605] [2022-12-06 07:28:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458152605] [2022-12-06 07:28:03,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458152605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069666976] [2022-12-06 07:28:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:03,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:03,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:03,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:03,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,867 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:03,868 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:28:03,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:03,884 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:03,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:03,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:03,885 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:03,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:03,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:03,922 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:03,922 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:03,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,922 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,948 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:03,948 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:28:03,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:03,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:03,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:04,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:28:04,089 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:04,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2022-12-06 07:28:04,089 INFO L420 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1407967484, now seen corresponding path program 1 times [2022-12-06 07:28:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480060274] [2022-12-06 07:28:04,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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:28:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480060274] [2022-12-06 07:28:04,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480060274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934001352] [2022-12-06 07:28:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:04,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:04,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:04,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:04,444 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:04,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:04,457 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:04,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:04,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:04,458 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:04,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:04,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:04,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:04,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:04,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:04,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:04,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:04,516 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:04,516 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:28:04,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:04,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:04,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:04,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:04,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:28:04,684 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:04,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:04,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:04,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2022-12-06 07:28:04,684 INFO L420 AbstractCegarLoop]: === Iteration 282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 334842851, now seen corresponding path program 1 times [2022-12-06 07:28:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:04,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327158537] [2022-12-06 07:28:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:04,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:28:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:04,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327158537] [2022-12-06 07:28:04,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327158537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:04,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:04,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061363617] [2022-12-06 07:28:04,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:04,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:04,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:04,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:04,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:04,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:04,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,003 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:05,003 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:05,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:05,017 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:05,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:05,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:05,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:05,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:05,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:05,053 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:05,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,053 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,077 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:05,078 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:05,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:05,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:05,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:28:05,227 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:05,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2022-12-06 07:28:05,227 INFO L420 AbstractCegarLoop]: === Iteration 283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653186, now seen corresponding path program 1 times [2022-12-06 07:28:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840607098] [2022-12-06 07:28:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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:05,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840607098] [2022-12-06 07:28:05,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840607098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983889466] [2022-12-06 07:28:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:05,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:05,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:05,555 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:05,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:05,568 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:05,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:05,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:05,569 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:05,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:05,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:05,602 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:05,602 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:05,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,602 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,628 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:05,628 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:28:05,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:05,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:05,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:05,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:28:05,787 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:05,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,787 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2022-12-06 07:28:05,787 INFO L420 AbstractCegarLoop]: === Iteration 284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:05,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash -474503775, now seen corresponding path program 1 times [2022-12-06 07:28:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397502018] [2022-12-06 07:28:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,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:28:05,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397502018] [2022-12-06 07:28:05,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397502018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:05,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:05,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981415581] [2022-12-06 07:28:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:05,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:05,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:05,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:06,117 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:06,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:06,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:06,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:06,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:06,132 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:06,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:06,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,167 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:06,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:06,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,193 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:06,193 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:06,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:06,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:06,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:28:06,349 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:06,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:06,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2022-12-06 07:28:06,350 INFO L420 AbstractCegarLoop]: === Iteration 285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1268306560, now seen corresponding path program 1 times [2022-12-06 07:28:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240695285] [2022-12-06 07:28:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:06,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:28:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240695285] [2022-12-06 07:28:06,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240695285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:06,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:06,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194250162] [2022-12-06 07:28:06,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:06,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:06,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:06,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:06,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:06,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:06,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:06,750 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:06,750 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:06,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:06,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:06,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:06,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:06,767 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:06,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:06,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:06,802 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:06,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:06,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:06,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:06,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:06,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,827 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:06,828 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:28:06,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:06,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:06,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:06,982 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:06,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:28:06,982 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:06,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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, 1, 1, 1, 1, 1] [2022-12-06 07:28:06,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2022-12-06 07:28:06,982 INFO L420 AbstractCegarLoop]: === Iteration 286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [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 -1283850401, now seen corresponding path program 1 times [2022-12-06 07:28:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:06,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828047602] [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,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:28:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828047602] [2022-12-06 07:28:07,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828047602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513656399] [2022-12-06 07:28:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:07,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:07,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,321 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:07,322 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:07,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:07,335 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:07,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:07,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:07,336 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:07,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:07,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,370 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:07,370 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:07,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,370 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,395 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:07,395 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:28:07,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:07,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:07,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:07,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 07:28:07,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:07,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:07,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2022-12-06 07:28:07,569 INFO L420 AbstractCegarLoop]: === Iteration 287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash 458959934, now seen corresponding path program 1 times [2022-12-06 07:28:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:07,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889112873] [2022-12-06 07:28:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:07,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:28:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:07,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889112873] [2022-12-06 07:28:07,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889112873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:07,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:07,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513571169] [2022-12-06 07:28:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:07,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:07,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:07,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:07,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:07,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:07,937 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:07,938 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:28:07,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:07,950 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:07,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:07,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:07,951 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:07,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:07,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:07,984 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:07,985 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:07,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:07,985 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:07,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:07,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:07,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,010 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:08,010 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:28:08,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:08,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:08,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:28:08,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2022-12-06 07:28:08,161 INFO L420 AbstractCegarLoop]: === Iteration 288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2093197027, now seen corresponding path program 1 times [2022-12-06 07:28:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771135353] [2022-12-06 07:28:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,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:28:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771135353] [2022-12-06 07:28:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771135353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476731645] [2022-12-06 07:28:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:08,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:08,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:08,503 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:08,503 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:28:08,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:08,517 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:08,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:08,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:08,518 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:08,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:08,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:08,552 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:08,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:08,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:08,552 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:08,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:08,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,578 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:08,578 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:08,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:08,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:08,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:08,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:08,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:28:08,726 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:08,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:08,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:08,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2022-12-06 07:28:08,726 INFO L420 AbstractCegarLoop]: === Iteration 289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash -350386692, now seen corresponding path program 1 times [2022-12-06 07:28:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:08,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624344188] [2022-12-06 07:28:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:08,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:08,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:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:08,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624344188] [2022-12-06 07:28:08,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624344188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:08,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:08,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062958898] [2022-12-06 07:28:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:08,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:08,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:08,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:08,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:08,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:08,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:08,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,073 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:09,073 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:09,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:09,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:09,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:09,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:09,088 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:09,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:09,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,127 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:09,127 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:09,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,127 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,153 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:09,154 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:28:09,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:09,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:09,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:28:09,301 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:09,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2022-12-06 07:28:09,301 INFO L420 AbstractCegarLoop]: === Iteration 290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1392423643, now seen corresponding path program 1 times [2022-12-06 07:28:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122367858] [2022-12-06 07:28:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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:28:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122367858] [2022-12-06 07:28:09,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122367858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227516718] [2022-12-06 07:28:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:09,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:09,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:09,650 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:09,650 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:09,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:09,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:09,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:09,665 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:09,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:09,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:09,701 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:09,702 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:09,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:09,702 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:09,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:09,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,727 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:09,727 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:09,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:09,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:09,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:09,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:09,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:28:09,895 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:09,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:09,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:09,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2022-12-06 07:28:09,895 INFO L420 AbstractCegarLoop]: === Iteration 291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1159733318, now seen corresponding path program 1 times [2022-12-06 07:28:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:09,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7064226] [2022-12-06 07:28:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:09,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:09,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:28:09,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:09,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7064226] [2022-12-06 07:28:09,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7064226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:09,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:09,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461107992] [2022-12-06 07:28:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:09,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:09,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:09,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:09,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:09,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,224 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:10,224 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:10,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13559 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:10,237 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:10,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:10,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:10,238 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:10,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:10,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,271 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:10,272 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:10,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,272 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,297 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:10,297 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:28:10,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:10,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:10,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:28:10,444 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:10,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2022-12-06 07:28:10,444 INFO L420 AbstractCegarLoop]: === Iteration 292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash 583077017, now seen corresponding path program 1 times [2022-12-06 07:28:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376266042] [2022-12-06 07:28:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:10,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:28:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:10,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376266042] [2022-12-06 07:28:10,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376266042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:10,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:10,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158043248] [2022-12-06 07:28:10,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:10,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:10,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:10,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:10,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:10,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:10,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:10,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:10,774 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:10,774 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:28:10,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:10,787 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:10,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:10,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:10,788 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:10,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:10,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:10,821 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:10,822 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:10,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:10,822 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:10,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:10,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,847 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:10,847 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:28:10,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:10,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:10,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:10,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:10,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:10,987 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:10,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:10,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2022-12-06 07:28:10,988 INFO L420 AbstractCegarLoop]: === Iteration 293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1969079944, now seen corresponding path program 1 times [2022-12-06 07:28:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:10,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543179097] [2022-12-06 07:28:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:11,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:28:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543179097] [2022-12-06 07:28:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543179097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556240989] [2022-12-06 07:28:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:11,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:11,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:11,307 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:11,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:11,319 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:11,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:11,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:11,320 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:11,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:11,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,352 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:11,353 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:11,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:11,353 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,378 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:11,379 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:28:11,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:11,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:11,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:11,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:28:11,514 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:11,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:11,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:11,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2022-12-06 07:28:11,514 INFO L420 AbstractCegarLoop]: === Iteration 294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -226269609, now seen corresponding path program 1 times [2022-12-06 07:28:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:11,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483679854] [2022-12-06 07:28:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:11,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:28:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:11,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483679854] [2022-12-06 07:28:11,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483679854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:11,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:11,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:11,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186119305] [2022-12-06 07:28:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:11,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:11,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:11,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:11,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:11,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:11,835 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:11,836 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:11,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:11,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:11,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:11,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:11,850 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:11,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:11,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:11,887 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:11,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:11,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:11,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,912 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:11,912 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:28:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:11,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:11,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:12,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:28:12,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:12,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2022-12-06 07:28:12,063 INFO L420 AbstractCegarLoop]: === Iteration 295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1516540726, now seen corresponding path program 1 times [2022-12-06 07:28:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548308903] [2022-12-06 07:28:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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:28:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548308903] [2022-12-06 07:28:12,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548308903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464231344] [2022-12-06 07:28:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:12,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:12,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,403 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:12,403 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:12,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:12,416 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:12,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:12,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:12,417 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:12,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:12,457 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:12,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:12,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:12,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:12,457 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:12,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:12,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:12,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:12,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:12,488 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:12,488 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:12,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:12,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:12,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:12,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:12,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:28:12,642 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:12,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:12,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:12,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2022-12-06 07:28:12,642 INFO L420 AbstractCegarLoop]: === Iteration 296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1035616235, now seen corresponding path program 1 times [2022-12-06 07:28:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:12,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124238794] [2022-12-06 07:28:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:12,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:28:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:12,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124238794] [2022-12-06 07:28:12,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124238794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:12,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:12,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939456841] [2022-12-06 07:28:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:12,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:12,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:12,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:12,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:12,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:12,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:12,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:12,986 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:12,986 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:12,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13488 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:13,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:13,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:13,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:13,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:13,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:13,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,043 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:13,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:13,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,043 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,069 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:13,069 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:13,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:13,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:13,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:28:13,204 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:13,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2022-12-06 07:28:13,205 INFO L420 AbstractCegarLoop]: === Iteration 297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 707194100, now seen corresponding path program 1 times [2022-12-06 07:28:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237300219] [2022-12-06 07:28:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237300219] [2022-12-06 07:28:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237300219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586282835] [2022-12-06 07:28:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:13,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:13,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:13,531 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:13,531 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:13,544 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:13,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:13,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:13,545 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:13,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:13,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:13,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:13,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:13,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:13,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:13,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:13,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,603 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:13,603 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:28:13,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:13,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:13,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:13,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:13,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:28:13,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:13,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:13,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:13,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2022-12-06 07:28:13,754 INFO L420 AbstractCegarLoop]: === Iteration 298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1844962861, now seen corresponding path program 1 times [2022-12-06 07:28:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:13,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804191754] [2022-12-06 07:28:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:13,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:28:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804191754] [2022-12-06 07:28:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804191754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:13,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:13,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93686986] [2022-12-06 07:28:13,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:13,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:13,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:13,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:13,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:13,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:13,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,071 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:14,072 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:14,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:14,084 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:14,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:14,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:14,085 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:14,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:14,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,120 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:14,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:14,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,145 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:14,145 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:28:14,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:14,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:14,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:28:14,286 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:14,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2022-12-06 07:28:14,287 INFO L420 AbstractCegarLoop]: === Iteration 299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,287 INFO L85 PathProgramCache]: Analyzing trace with hash -102152526, now seen corresponding path program 1 times [2022-12-06 07:28:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868211730] [2022-12-06 07:28:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:14,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:28:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868211730] [2022-12-06 07:28:14,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868211730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960253411] [2022-12-06 07:28:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:14,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:14,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:14,616 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:14,616 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:14,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:14,628 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:14,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:14,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:14,629 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:14,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:14,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:14,663 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:14,663 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:14,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:14,663 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:14,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:14,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,688 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:14,688 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:14,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:14,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:14,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:14,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:14,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:28:14,844 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:14,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:14,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:14,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2022-12-06 07:28:14,844 INFO L420 AbstractCegarLoop]: === Iteration 300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1640657809, now seen corresponding path program 1 times [2022-12-06 07:28:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569298507] [2022-12-06 07:28:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:14,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569298507] [2022-12-06 07:28:14,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569298507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:14,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:14,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110722172] [2022-12-06 07:28:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:14,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:14,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:14,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:14,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:14,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,174 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:15,175 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:15,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:15,187 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:15,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:15,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:15,188 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:15,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:15,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,223 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:15,223 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:15,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,223 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,223 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,248 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:15,248 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:28:15,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:15,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:15,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:28:15,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:15,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2022-12-06 07:28:15,413 INFO L420 AbstractCegarLoop]: === Iteration 301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash -911499152, now seen corresponding path program 1 times [2022-12-06 07:28:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196630743] [2022-12-06 07:28:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:15,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:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:15,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196630743] [2022-12-06 07:28:15,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196630743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:15,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:15,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517419221] [2022-12-06 07:28:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:15,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:15,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:15,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:15,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:15,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:15,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:15,755 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:15,755 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:15,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:15,767 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:15,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:15,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:15,768 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:15,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:15,800 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:15,800 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:15,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:15,800 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:15,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:15,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,825 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:15,825 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:15,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:15,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:15,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:15,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:15,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:28:15,989 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:15,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:15,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:15,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2022-12-06 07:28:15,989 INFO L420 AbstractCegarLoop]: === Iteration 302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:15,989 INFO L85 PathProgramCache]: Analyzing trace with hash 831311183, now seen corresponding path program 1 times [2022-12-06 07:28:15,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:15,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400883752] [2022-12-06 07:28:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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:28:16,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400883752] [2022-12-06 07:28:16,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400883752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45575803] [2022-12-06 07:28:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:16,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:16,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:16,327 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:28:16,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:16,342 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:16,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:16,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:16,343 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:16,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,384 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:16,384 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:16,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,384 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,411 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:16,411 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:28:16,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:16,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:16,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:16,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:28:16,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:16,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:16,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:16,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2022-12-06 07:28:16,556 INFO L420 AbstractCegarLoop]: === Iteration 303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1720845778, now seen corresponding path program 1 times [2022-12-06 07:28:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570276633] [2022-12-06 07:28:16,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:16,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:28:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:16,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570276633] [2022-12-06 07:28:16,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570276633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:16,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:16,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747666065] [2022-12-06 07:28:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:16,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:16,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:16,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:16,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:16,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:16,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:16,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:16,881 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:16,881 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:16,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:16,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:16,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:16,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:16,895 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:16,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:16,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:16,930 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:16,930 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:16,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:16,930 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:16,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:16,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,956 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:16,956 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:16,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:16,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:16,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:17,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:28:17,106 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:17,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2022-12-06 07:28:17,106 INFO L420 AbstractCegarLoop]: === Iteration 304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 21964557, now seen corresponding path program 1 times [2022-12-06 07:28:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522365349] [2022-12-06 07:28:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522365349] [2022-12-06 07:28:17,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522365349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423529733] [2022-12-06 07:28:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:17,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:17,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:17,425 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:17,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:17,438 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:17,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:17,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:17,439 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:17,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:17,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:17,474 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:17,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:17,474 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:17,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:17,475 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:17,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:17,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:17,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:17,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:17,499 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:17,500 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:28:17,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:17,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:17,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:17,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:17,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:28:17,653 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:17,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:17,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:17,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2022-12-06 07:28:17,653 INFO L420 AbstractCegarLoop]: === Iteration 305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1764774892, now seen corresponding path program 1 times [2022-12-06 07:28:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:17,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95881947] [2022-12-06 07:28:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:17,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:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:17,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95881947] [2022-12-06 07:28:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95881947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:17,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:17,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116589237] [2022-12-06 07:28:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:17,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:17,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:17,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:17,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:17,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:17,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:17,989 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:28:17,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:18,002 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:18,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:18,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:18,003 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:18,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:18,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,037 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:18,037 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:18,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,037 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,063 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:18,064 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 07:28:18,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3339/3551 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:18,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:18,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:28:18,215 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:18,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2022-12-06 07:28:18,215 INFO L420 AbstractCegarLoop]: === Iteration 306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash -787382069, now seen corresponding path program 1 times [2022-12-06 07:28:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002354282] [2022-12-06 07:28:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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:28:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002354282] [2022-12-06 07:28:18,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002354282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592910990] [2022-12-06 07:28:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:18,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:18,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:18,553 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:18,553 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:18,567 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:18,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:18,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:18,568 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:18,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:18,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:18,602 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:18,602 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:18,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:18,602 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:18,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:18,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,629 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:18,629 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:28:18,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:18,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:18,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:18,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:18,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:28:18,781 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:18,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:18,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:18,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2022-12-06 07:28:18,781 INFO L420 AbstractCegarLoop]: === Iteration 307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash 955428266, now seen corresponding path program 1 times [2022-12-06 07:28:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:18,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756108121] [2022-12-06 07:28:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:18,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:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756108121] [2022-12-06 07:28:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756108121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:18,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:18,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279149383] [2022-12-06 07:28:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:18,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:18,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:18,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:18,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:18,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,171 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:19,171 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:19,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:19,184 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:19,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:19,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:19,185 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:19,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,219 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:19,219 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:19,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,219 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,244 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:19,245 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:19,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:19,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:19,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:28:19,396 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:19,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2022-12-06 07:28:19,396 INFO L420 AbstractCegarLoop]: === Iteration 308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1596728695, now seen corresponding path program 1 times [2022-12-06 07:28:19,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763940060] [2022-12-06 07:28:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:19,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:28:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:19,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763940060] [2022-12-06 07:28:19,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763940060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:19,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:19,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194509062] [2022-12-06 07:28:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:19,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:19,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:19,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:19,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:19,731 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:19,732 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:19,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:19,746 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:19,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:19,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:19,747 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:19,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:19,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:19,782 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:19,783 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:19,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:19,783 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:19,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:19,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,808 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:19,808 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:19,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:19,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:19,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:19,952 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:19,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:28:19,953 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:19,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:19,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2022-12-06 07:28:19,953 INFO L420 AbstractCegarLoop]: === Iteration 309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash 146081640, now seen corresponding path program 1 times [2022-12-06 07:28:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:19,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995414072] [2022-12-06 07:28:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:20,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:28:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995414072] [2022-12-06 07:28:20,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995414072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336831632] [2022-12-06 07:28:20,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:20,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:20,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,299 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:20,300 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:20,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:20,314 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:20,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:20,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:20,315 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:20,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:20,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:20,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:20,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,380 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:20,380 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:20,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:20,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:20,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:20,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:28:20,517 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:20,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:20,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:20,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2022-12-06 07:28:20,517 INFO L420 AbstractCegarLoop]: === Iteration 310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1888891975, now seen corresponding path program 1 times [2022-12-06 07:28:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:20,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783387868] [2022-12-06 07:28:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:20,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:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:20,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783387868] [2022-12-06 07:28:20,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783387868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:20,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:20,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023057543] [2022-12-06 07:28:20,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:20,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:20,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:20,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:20,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:20,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:20,843 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:20,843 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:20,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:20,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:20,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:20,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:20,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:20,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:20,896 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:20,896 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:20,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:20,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:20,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:20,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,922 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:20,922 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:28:20,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:20,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:20,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:21,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,076 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:28:21,076 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:21,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2022-12-06 07:28:21,076 INFO L420 AbstractCegarLoop]: === Iteration 311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -663264986, 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,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526483909] [2022-12-06 07:28:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,077 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,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:28:21,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526483909] [2022-12-06 07:28:21,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526483909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:21,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301872752] [2022-12-06 07:28:21,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:21,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:21,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,403 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:21,403 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:28:21,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13528 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:21,416 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:21,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:21,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:21,417 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:21,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:21,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:21,452 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:21,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:21,452 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:21,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:21,452 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:21,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:21,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:21,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:21,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:21,477 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:21,478 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:28:21,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:21,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:21,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:21,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:21,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:21,621 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:21,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:21,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:21,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2022-12-06 07:28:21,622 INFO L420 AbstractCegarLoop]: === Iteration 312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1079545349, now seen corresponding path program 1 times [2022-12-06 07:28:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107286176] [2022-12-06 07:28:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:21,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:28:21,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:21,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107286176] [2022-12-06 07:28:21,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107286176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:21,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:21,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681948077] [2022-12-06 07:28:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:21,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:21,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:21,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:21,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:21,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:21,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:21,961 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:21,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:21,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:21,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:21,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:21,975 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:21,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:22,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,009 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:22,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:22,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,036 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:22,037 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:22,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:22,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:22,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:28:22,182 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:22,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2022-12-06 07:28:22,183 INFO L420 AbstractCegarLoop]: === Iteration 313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1472611612, now seen corresponding path program 1 times [2022-12-06 07:28:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206990522] [2022-12-06 07:28:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206990522] [2022-12-06 07:28:22,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206990522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022837784] [2022-12-06 07:28:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:22,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:22,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:22,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:22,524 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:22,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:22,539 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:22,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:22,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:22,540 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:22,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:22,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:22,575 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:22,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:22,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:22,575 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:22,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:22,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,600 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:22,600 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:28:22,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:22,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:22,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:22,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:22,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:28:22,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:22,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:22,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:22,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2022-12-06 07:28:22,735 INFO L420 AbstractCegarLoop]: === Iteration 314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash 270198723, now seen corresponding path program 1 times [2022-12-06 07:28:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:22,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265452203] [2022-12-06 07:28:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:22,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:28:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:22,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265452203] [2022-12-06 07:28:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265452203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:22,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:22,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705931933] [2022-12-06 07:28:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:22,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:22,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:22,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:22,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:22,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,105 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:23,105 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:23,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:23,123 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:23,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:23,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:23,123 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:23,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:23,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,159 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:23,160 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:23,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,160 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,185 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:23,185 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:23,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:23,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:23,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:23,325 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:23,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2022-12-06 07:28:23,325 INFO L420 AbstractCegarLoop]: === Iteration 315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2013009058, now seen corresponding path program 1 times [2022-12-06 07:28:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500768722] [2022-12-06 07:28:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:23,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:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500768722] [2022-12-06 07:28:23,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500768722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:23,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865956118] [2022-12-06 07:28:23,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:23,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:23,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:23,655 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:23,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:23,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:23,670 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:23,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:23,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:23,671 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:23,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:23,706 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:23,706 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:23,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:23,706 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:23,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:23,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,732 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:23,733 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:23,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:23,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:23,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:23,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:23,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:28:23,885 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:23,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:23,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:23,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2022-12-06 07:28:23,885 INFO L420 AbstractCegarLoop]: === Iteration 316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -539147903, now seen corresponding path program 1 times [2022-12-06 07:28:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:23,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197649243] [2022-12-06 07:28:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:23,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:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:23,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197649243] [2022-12-06 07:28:23,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197649243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:23,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:23,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418212971] [2022-12-06 07:28:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:23,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:23,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:23,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:23,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:23,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,232 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:24,232 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:24,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:24,246 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:24,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:24,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:24,247 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:24,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:24,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,287 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:24,287 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:24,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,287 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,316 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:24,316 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:28:24,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:24,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:24,478 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:24,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:28:24,479 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:24,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:24,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:24,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2022-12-06 07:28:24,479 INFO L420 AbstractCegarLoop]: === Iteration 317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1203662432, now seen corresponding path program 1 times [2022-12-06 07:28:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:24,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959473842] [2022-12-06 07:28:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:24,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:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:24,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959473842] [2022-12-06 07:28:24,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959473842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:24,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:24,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784084298] [2022-12-06 07:28:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:24,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:24,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:24,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:24,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:24,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:24,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:24,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:24,805 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:24,805 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:24,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:24,818 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:24,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:24,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:24,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:24,819 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:24,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:24,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:24,852 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,852 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:24,853 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:24,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:24,853 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:24,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:24,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,878 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:24,878 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:28:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:24,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:24,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:25,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:28:25,044 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:25,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,044 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2022-12-06 07:28:25,044 INFO L420 AbstractCegarLoop]: === Iteration 318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1348494529, now seen corresponding path program 1 times [2022-12-06 07:28:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931666124] [2022-12-06 07:28:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931666124] [2022-12-06 07:28:25,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931666124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081332731] [2022-12-06 07:28:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:25,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:25,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,365 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:25,366 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:25,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:25,379 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:25,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:25,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:25,380 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:25,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:25,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,414 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:25,415 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:25,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,415 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,440 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:25,440 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:25,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:25,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:25,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:25,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:25,584 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:25,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:25,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:25,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2022-12-06 07:28:25,584 INFO L420 AbstractCegarLoop]: === Iteration 319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 394315806, now seen corresponding path program 1 times [2022-12-06 07:28:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:25,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714495493] [2022-12-06 07:28:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:25,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:28:25,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:25,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714495493] [2022-12-06 07:28:25,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714495493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:25,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:25,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514720890] [2022-12-06 07:28:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:25,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:25,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:25,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:25,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:25,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:25,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:25,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:25,923 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:25,923 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:25,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:25,936 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:25,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:25,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:25,937 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:25,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:25,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:25,972 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:25,973 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:25,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:25,973 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:25,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:25,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:25,998 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:25,998 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:28:25,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:26,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:26,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:26,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:28:26,140 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:26,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2022-12-06 07:28:26,140 INFO L420 AbstractCegarLoop]: === Iteration 320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2137126141, now seen corresponding path program 1 times [2022-12-06 07:28:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081621355] [2022-12-06 07:28:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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:28:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081621355] [2022-12-06 07:28:26,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081621355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209026000] [2022-12-06 07:28:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:26,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:26,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:26,473 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:26,473 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:26,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:26,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:26,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:26,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:26,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:26,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:26,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:26,524 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:26,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:26,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:26,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:26,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:26,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:26,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:26,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:26,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:26,549 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:26,549 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:26,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:26,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:26,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:26,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:26,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:26,693 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:26,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:26,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:26,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2022-12-06 07:28:26,694 INFO L420 AbstractCegarLoop]: === Iteration 321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -415030820, now seen corresponding path program 1 times [2022-12-06 07:28:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:26,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547555492] [2022-12-06 07:28:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:26,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:28:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:26,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547555492] [2022-12-06 07:28:26,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547555492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:26,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:26,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489199847] [2022-12-06 07:28:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:26,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:26,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:26,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:26,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:26,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:26,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:26,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:27,045 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:27,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:27,059 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:27,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:27,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:27,059 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:27,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:27,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,096 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:27,096 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:27,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,096 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,122 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:27,122 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:27,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:27,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:27,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 07:28:27,293 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:27,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2022-12-06 07:28:27,293 INFO L420 AbstractCegarLoop]: === Iteration 322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1327779515, now seen corresponding path program 1 times [2022-12-06 07:28:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773692566] [2022-12-06 07:28:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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:28:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773692566] [2022-12-06 07:28:27,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773692566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560406422] [2022-12-06 07:28:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:27,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:27,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:27,644 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:27,644 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:27,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:27,659 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:27,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:27,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:27,660 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:27,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:27,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:27,697 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:27,698 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:27,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:27,698 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:27,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:27,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,723 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:27,723 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:27,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:27,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:27,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:27,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:27,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:28:27,872 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:27,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:27,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:27,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2022-12-06 07:28:27,872 INFO L420 AbstractCegarLoop]: === Iteration 323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1224377446, now seen corresponding path program 1 times [2022-12-06 07:28:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:27,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624884659] [2022-12-06 07:28:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:27,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:28:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:27,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624884659] [2022-12-06 07:28:27,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624884659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:27,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:27,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869257354] [2022-12-06 07:28:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:27,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:27,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:27,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:27,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,200 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:28,200 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:28,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:28,213 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:28,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:28,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:28,214 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:28,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:28,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,251 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:28,251 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:28,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,251 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,277 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:28,277 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:28,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:28,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:28,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:28:28,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:28,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2022-12-06 07:28:28,421 INFO L420 AbstractCegarLoop]: === Iteration 324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 518432889, now seen corresponding path program 1 times [2022-12-06 07:28:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098095106] [2022-12-06 07:28:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098095106] [2022-12-06 07:28:28,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098095106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:28,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:28,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554078551] [2022-12-06 07:28:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:28,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:28,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:28,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:28,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:28,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:28,747 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:28,747 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:28,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:28,761 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:28,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:28,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:28,762 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:28,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:28,797 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:28,797 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:28,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:28,797 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,798 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:28,798 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:28,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,823 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:28,824 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:28:28,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:28,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:28,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:28,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:28,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:28,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:28,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:28,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2022-12-06 07:28:28,967 INFO L420 AbstractCegarLoop]: === Iteration 325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:28,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:28,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2033724072, now seen corresponding path program 1 times [2022-12-06 07:28:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:28,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288421904] [2022-12-06 07:28:28,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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:29,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288421904] [2022-12-06 07:28:29,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288421904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312096344] [2022-12-06 07:28:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:29,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:29,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,296 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:29,296 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:29,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:29,309 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:29,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:29,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:29,310 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:29,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:29,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,342 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:29,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:29,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,368 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:29,368 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:29,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:29,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:29,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:29,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:28:29,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:29,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2022-12-06 07:28:29,511 INFO L420 AbstractCegarLoop]: === Iteration 326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash -290913737, now seen corresponding path program 1 times [2022-12-06 07:28:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:29,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579051191] [2022-12-06 07:28:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:29,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:28:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579051191] [2022-12-06 07:28:29,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579051191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:29,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:29,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773140221] [2022-12-06 07:28:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:29,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:29,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:29,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:29,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:29,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:29,831 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:29,832 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:29,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:29,845 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:29,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:29,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:29,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:29,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:29,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:29,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:29,882 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:29,882 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:29,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:29,882 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:29,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:29,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,908 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:29,908 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:28:29,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:29,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:29,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:30,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:28:30,044 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:30,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2022-12-06 07:28:30,045 INFO L420 AbstractCegarLoop]: === Iteration 327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1451896598, now seen corresponding path program 1 times [2022-12-06 07:28:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402909396] [2022-12-06 07:28:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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:28:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402909396] [2022-12-06 07:28:30,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402909396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883783412] [2022-12-06 07:28:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:30,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:30,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,392 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:30,393 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:28:30,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:30,411 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:30,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:30,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:30,412 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:30,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:30,448 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:30,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:30,448 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:30,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:30,448 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:30,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:30,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:30,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:30,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:30,473 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:30,474 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:28:30,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:30,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:30,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:30,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:30,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:28:30,621 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:30,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:30,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:30,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2022-12-06 07:28:30,622 INFO L420 AbstractCegarLoop]: === Iteration 328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:30,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1100260363, now seen corresponding path program 1 times [2022-12-06 07:28:30,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:30,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497292544] [2022-12-06 07:28:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:30,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:30,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:28:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:30,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497292544] [2022-12-06 07:28:30,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497292544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:30,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:30,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48734906] [2022-12-06 07:28:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:30,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:30,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:30,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:30,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:30,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:30,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:30,956 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:30,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:30,969 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:30,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:30,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:30,970 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:30,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:31,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,004 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:31,004 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:31,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,004 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,029 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:31,029 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:28:31,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:31,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:31,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:28:31,177 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:31,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2022-12-06 07:28:31,177 INFO L420 AbstractCegarLoop]: === Iteration 329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:31,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash 642549972, now seen corresponding path program 1 times [2022-12-06 07:28:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986401664] [2022-12-06 07:28:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:31,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:28:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986401664] [2022-12-06 07:28:31,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986401664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775804877] [2022-12-06 07:28:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:31,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:31,521 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:31,521 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:31,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:31,534 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:31,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:31,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:31,535 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:31,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:31,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:31,568 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:31,568 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:31,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:31,568 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:31,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:31,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,594 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:31,594 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:28:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:31,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:31,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:31,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:31,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:28:31,742 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:31,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:31,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:31,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2022-12-06 07:28:31,742 INFO L420 AbstractCegarLoop]: === Iteration 330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1909606989, now seen corresponding path program 1 times [2022-12-06 07:28:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:31,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022658231] [2022-12-06 07:28:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:31,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:28:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022658231] [2022-12-06 07:28:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022658231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:31,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:31,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392293389] [2022-12-06 07:28:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:31,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:31,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:31,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,087 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:32,087 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:32,104 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:32,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:32,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:32,105 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:32,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:32,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,144 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:32,144 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:32,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,144 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,169 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:32,170 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:32,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:32,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:32,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:28:32,314 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:32,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,314 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2022-12-06 07:28:32,314 INFO L420 AbstractCegarLoop]: === Iteration 331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash -166796654, now seen corresponding path program 1 times [2022-12-06 07:28:32,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253492319] [2022-12-06 07:28:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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:28:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253492319] [2022-12-06 07:28:32,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253492319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697628885] [2022-12-06 07:28:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:32,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:32,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:32,675 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:32,675 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:32,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:32,689 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:32,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:32,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:32,690 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:32,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:32,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:32,726 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:32,727 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:32,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:32,727 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:32,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:32,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,752 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:32,752 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:32,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:32,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:32,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:32,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:32,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:28:32,888 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:32,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:32,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:32,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2022-12-06 07:28:32,888 INFO L420 AbstractCegarLoop]: === Iteration 332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1576013681, now seen corresponding path program 1 times [2022-12-06 07:28:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:32,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495674331] [2022-12-06 07:28:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:32,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:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:32,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495674331] [2022-12-06 07:28:32,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495674331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:32,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:32,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277712895] [2022-12-06 07:28:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:32,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:32,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:32,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:32,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:32,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,257 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:33,257 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:33,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:33,271 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:33,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:33,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:33,272 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:33,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:33,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:33,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:33,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,337 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:33,337 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:33,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:33,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:33,479 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:33,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:33,480 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:33,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:33,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:33,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2022-12-06 07:28:33,480 INFO L420 AbstractCegarLoop]: === Iteration 333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -976143280, now seen corresponding path program 1 times [2022-12-06 07:28:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:33,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489190546] [2022-12-06 07:28:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:33,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:28:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:33,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489190546] [2022-12-06 07:28:33,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489190546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:33,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:33,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778879154] [2022-12-06 07:28:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:33,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:33,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:33,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:33,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:33,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:33,822 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:33,822 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:33,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13544 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:33,835 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:33,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:33,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:33,836 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:33,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:33,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:33,870 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:33,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:33,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:33,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:33,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:33,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,896 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:33,896 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:28:33,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:33,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:33,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:34,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:28:34,027 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:34,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,027 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2022-12-06 07:28:34,028 INFO L420 AbstractCegarLoop]: === Iteration 334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 766667055, now seen corresponding path program 1 times [2022-12-06 07:28:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930994991] [2022-12-06 07:28:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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:28:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930994991] [2022-12-06 07:28:34,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930994991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793069175] [2022-12-06 07:28:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:34,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:34,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,358 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:34,358 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:28:34,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:34,371 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:34,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:34,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:34,372 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:34,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:34,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,408 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:34,409 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:34,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,409 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,433 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:34,434 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:34,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:34,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:34,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:34,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:34,574 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:34,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:34,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2022-12-06 07:28:34,574 INFO L420 AbstractCegarLoop]: === Iteration 335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1785489906, now seen corresponding path program 1 times [2022-12-06 07:28:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:34,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790863548] [2022-12-06 07:28:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:34,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:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790863548] [2022-12-06 07:28:34,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790863548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:34,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:34,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221869607] [2022-12-06 07:28:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:34,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:34,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:34,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:34,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:34,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:34,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:34,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:34,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:34,918 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:34,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:34,930 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:34,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:34,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:34,931 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:34,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:34,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:34,968 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:34,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:34,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:34,969 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:34,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:34,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,993 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:34,994 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:34,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:34,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:34,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:35,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:28:35,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:35,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2022-12-06 07:28:35,158 INFO L420 AbstractCegarLoop]: === Iteration 336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -42679571, now seen corresponding path program 1 times [2022-12-06 07:28:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228558395] [2022-12-06 07:28:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:35,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:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228558395] [2022-12-06 07:28:35,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228558395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642086847] [2022-12-06 07:28:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:35,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:35,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:35,537 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:35,537 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:35,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13589 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:35,550 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:35,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:35,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:35,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:35,551 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:35,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:35,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:35,588 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:35,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:35,588 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:35,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:35,588 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:35,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:35,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:35,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:35,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:35,615 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:35,615 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:35,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:35,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:35,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:35,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:35,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:28:35,760 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:35,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:35,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:35,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2022-12-06 07:28:35,761 INFO L420 AbstractCegarLoop]: === Iteration 337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:35,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1700130764, now seen corresponding path program 1 times [2022-12-06 07:28:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:35,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179771882] [2022-12-06 07:28:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:35,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:28:35,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:35,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179771882] [2022-12-06 07:28:35,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179771882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:35,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:35,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287487456] [2022-12-06 07:28:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:35,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:35,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:35,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:35,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:35,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,104 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:36,104 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:28:36,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13530 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:36,118 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:36,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:36,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:36,118 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:36,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:36,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,150 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:36,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:36,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,176 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:36,176 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:28:36,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:36,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:36,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 07:28:36,306 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:36,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2022-12-06 07:28:36,306 INFO L420 AbstractCegarLoop]: === Iteration 338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash -852026197, now seen corresponding path program 1 times [2022-12-06 07:28:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983323070] [2022-12-06 07:28:36,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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:28:36,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983323070] [2022-12-06 07:28:36,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983323070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681773325] [2022-12-06 07:28:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:36,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:36,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:36,649 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:36,650 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:36,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:36,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:36,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:36,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:36,664 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:36,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:36,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:36,701 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:36,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:36,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:36,701 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:36,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:36,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,726 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:36,726 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:36,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:36,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:36,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:36,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:36,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:28:36,860 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:36,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:36,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:36,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2022-12-06 07:28:36,861 INFO L420 AbstractCegarLoop]: === Iteration 339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 890784138, now seen corresponding path program 1 times [2022-12-06 07:28:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:36,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115832411] [2022-12-06 07:28:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:36,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:28:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:36,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115832411] [2022-12-06 07:28:36,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115832411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:36,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:36,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952771632] [2022-12-06 07:28:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:36,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:36,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:36,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:36,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:36,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:36,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:36,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:36,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,208 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:37,208 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:37,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:37,222 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:37,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:37,223 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:37,223 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:37,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:37,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:37,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,262 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:37,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:37,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,288 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:37,288 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:37,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:37,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:37,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:37,427 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:37,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2022-12-06 07:28:37,427 INFO L420 AbstractCegarLoop]: === Iteration 340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1661372823, now seen corresponding path program 1 times [2022-12-06 07:28:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089237109] [2022-12-06 07:28:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:37,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:28:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089237109] [2022-12-06 07:28:37,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089237109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:37,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:37,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058349193] [2022-12-06 07:28:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:37,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:37,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:37,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:37,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:37,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:37,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:37,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:37,774 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:37,775 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:37,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:37,789 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:37,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:37,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:37,789 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:37,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:37,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:37,829 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:37,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:37,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:37,829 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,829 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,855 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:37,856 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:37,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:37,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:37,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:37,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:37,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:28:37,992 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:37,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:37,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:37,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2022-12-06 07:28:37,992 INFO L420 AbstractCegarLoop]: === Iteration 341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash 81437512, now seen corresponding path program 1 times [2022-12-06 07:28:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:37,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321106545] [2022-12-06 07:28:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:38,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:28:38,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321106545] [2022-12-06 07:28:38,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321106545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123474342] [2022-12-06 07:28:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:38,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,325 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:38,325 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:28:38,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13544 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:38,337 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:38,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:38,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:38,338 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:38,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:38,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:38,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:38,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,411 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:38,411 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:28:38,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:38,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:38,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:38,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:28:38,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:38,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:38,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:38,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2022-12-06 07:28:38,567 INFO L420 AbstractCegarLoop]: === Iteration 342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1824247847, now seen corresponding path program 1 times [2022-12-06 07:28:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:38,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95856340] [2022-12-06 07:28:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:38,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:28:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95856340] [2022-12-06 07:28:38,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95856340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:38,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:38,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445023111] [2022-12-06 07:28:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:38,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:38,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:38,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:38,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:38,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:38,914 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:38,914 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:38,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:38,927 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:38,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:38,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:38,928 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:38,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:38,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:38,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:38,964 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:38,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:38,964 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:38,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:38,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,990 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:38,990 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:38,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:38,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:38,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:39,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:28:39,151 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:39,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2022-12-06 07:28:39,151 INFO L420 AbstractCegarLoop]: === Iteration 343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -727909114, now seen corresponding path program 1 times [2022-12-06 07:28:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417325157] [2022-12-06 07:28:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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:28:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417325157] [2022-12-06 07:28:39,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417325157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389876913] [2022-12-06 07:28:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:39,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:39,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:39,531 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:39,531 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:39,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:39,544 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:39,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:39,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:39,545 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:39,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:39,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:39,581 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:39,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:39,581 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:39,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:39,582 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:39,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:39,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:39,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:39,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:39,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:39,608 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:28:39,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:39,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:39,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:39,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:39,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:28:39,744 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:39,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:39,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:39,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2022-12-06 07:28:39,744 INFO L420 AbstractCegarLoop]: === Iteration 344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1014901221, now seen corresponding path program 1 times [2022-12-06 07:28:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805227129] [2022-12-06 07:28:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:39,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:28:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:39,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805227129] [2022-12-06 07:28:39,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805227129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:39,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:39,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:39,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063044392] [2022-12-06 07:28:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:39,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:39,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:39,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:39,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:39,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,074 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:40,074 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:40,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:40,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:40,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:40,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:40,088 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:40,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:40,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,124 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:40,124 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:40,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,124 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,151 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:40,151 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:40,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:40,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:40,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:28:40,288 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2022-12-06 07:28:40,288 INFO L420 AbstractCegarLoop]: === Iteration 345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1537255740, now seen corresponding path program 1 times [2022-12-06 07:28:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546117799] [2022-12-06 07:28:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:40,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:28:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546117799] [2022-12-06 07:28:40,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546117799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712112294] [2022-12-06 07:28:40,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:40,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:40,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:40,637 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:40,637 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:40,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:40,651 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:40,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:40,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:40,652 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:40,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:40,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:40,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:40,686 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:40,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:40,686 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:40,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:40,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,712 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:40,712 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:28:40,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:40,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:40,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:40,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:40,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 07:28:40,881 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:40,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:40,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:40,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2022-12-06 07:28:40,881 INFO L420 AbstractCegarLoop]: === Iteration 346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 205554595, now seen corresponding path program 1 times [2022-12-06 07:28:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:40,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609718419] [2022-12-06 07:28:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:40,882 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,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:40,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:40,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609718419] [2022-12-06 07:28:40,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609718419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:40,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:40,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394783596] [2022-12-06 07:28:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:40,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:40,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:40,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:40,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:40,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:40,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,212 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:41,212 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:28:41,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:41,226 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:41,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:41,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:41,226 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:41,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:41,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,265 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:41,265 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:41,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,265 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,291 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:41,291 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:28:41,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:41,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:41,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:41,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 07:28:41,495 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:41,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:41,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:41,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2022-12-06 07:28:41,495 INFO L420 AbstractCegarLoop]: === Iteration 347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1948364930, now seen corresponding path program 1 times [2022-12-06 07:28:41,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:41,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032755522] [2022-12-06 07:28:41,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:41,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:28:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:41,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032755522] [2022-12-06 07:28:41,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032755522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:41,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:41,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328472393] [2022-12-06 07:28:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:41,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:41,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:41,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:41,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:41,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:41,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:41,834 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:41,834 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:41,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:41,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:41,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:41,850 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:41,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:41,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:41,886 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:41,886 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:41,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:41,887 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:41,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:41,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,913 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:41,913 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:28:41,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:41,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:41,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:42,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 07:28:42,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:42,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2022-12-06 07:28:42,123 INFO L420 AbstractCegarLoop]: === Iteration 348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash -603792031, now seen corresponding path program 1 times [2022-12-06 07:28:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146532873] [2022-12-06 07:28:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146532873] [2022-12-06 07:28:42,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146532873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800710884] [2022-12-06 07:28:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:42,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:42,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:42,474 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:42,474 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:42,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:42,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:42,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:42,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:42,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:42,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:42,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:42,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:42,527 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:42,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:42,527 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:42,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:42,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:42,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:42,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:42,551 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:42,552 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:42,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:42,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:42,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:42,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:42,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:28:42,712 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:42,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:42,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:42,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2022-12-06 07:28:42,712 INFO L420 AbstractCegarLoop]: === Iteration 349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1139018304, now seen corresponding path program 1 times [2022-12-06 07:28:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:42,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563088150] [2022-12-06 07:28:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:42,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:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563088150] [2022-12-06 07:28:42,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563088150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:42,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:42,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455963075] [2022-12-06 07:28:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:42,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:42,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:42,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:42,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:42,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,071 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:43,071 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:43,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13588 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:43,090 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:43,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:43,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:43,091 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:43,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,133 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:43,133 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:43,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,133 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,158 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:43,158 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:43,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:43,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:43,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:28:43,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:43,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2022-12-06 07:28:43,297 INFO L420 AbstractCegarLoop]: === Iteration 350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1413138657, now seen corresponding path program 1 times [2022-12-06 07:28:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350748039] [2022-12-06 07:28:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,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:28:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350748039] [2022-12-06 07:28:43,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350748039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229506462] [2022-12-06 07:28:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:43,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:43,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:43,628 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:43,628 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:43,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:43,641 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:43,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:43,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:43,642 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:43,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:43,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:43,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:43,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:43,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:43,679 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:43,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:43,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:43,705 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:43,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:43,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:43,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:43,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:28:43,855 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:43,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:43,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:43,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2022-12-06 07:28:43,855 INFO L420 AbstractCegarLoop]: === Iteration 351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 329671678, now seen corresponding path program 1 times [2022-12-06 07:28:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:43,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807231430] [2022-12-06 07:28:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:43,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:28:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:43,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807231430] [2022-12-06 07:28:43,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807231430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:43,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:43,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:43,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631860064] [2022-12-06 07:28:43,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:43,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:43,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:43,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:43,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:43,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:43,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,197 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:44,197 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:44,210 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:44,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:44,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:44,211 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:44,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:44,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,246 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:44,246 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:44,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,246 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,272 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:44,272 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:28:44,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:44,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:44,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:28:44,408 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:44,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2022-12-06 07:28:44,408 INFO L420 AbstractCegarLoop]: === Iteration 352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2072482013, now seen corresponding path program 1 times [2022-12-06 07:28:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312349989] [2022-12-06 07:28:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:44,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312349989] [2022-12-06 07:28:44,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312349989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:44,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:44,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637346697] [2022-12-06 07:28:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:44,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:44,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:44,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:44,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:44,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:44,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:44,734 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:44,734 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:44,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:44,748 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:44,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:44,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:44,748 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:44,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:44,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:44,785 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:44,785 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:44,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:44,785 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:44,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:44,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,810 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:44,810 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:44,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:44,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:44,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:44,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:44,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:28:44,944 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:44,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:44,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:44,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2022-12-06 07:28:44,944 INFO L420 AbstractCegarLoop]: === Iteration 353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -479674948, now seen corresponding path program 1 times [2022-12-06 07:28:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:44,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519488169] [2022-12-06 07:28:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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:28:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519488169] [2022-12-06 07:28:45,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519488169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631655771] [2022-12-06 07:28:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:45,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:45,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,287 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:45,287 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:45,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:45,300 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:45,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:45,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:45,301 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:45,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:45,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,336 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:45,336 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:45,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,336 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,362 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:45,362 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:45,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:45,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:45,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:45,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:28:45,515 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:45,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:45,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:45,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2022-12-06 07:28:45,516 INFO L420 AbstractCegarLoop]: === Iteration 354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1263135387, now seen corresponding path program 1 times [2022-12-06 07:28:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:45,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787873532] [2022-12-06 07:28:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:45,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:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:45,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787873532] [2022-12-06 07:28:45,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787873532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:45,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:45,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140795151] [2022-12-06 07:28:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:45,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:45,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:45,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:45,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:45,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:45,846 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:45,846 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:45,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:45,860 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:45,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:45,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:45,861 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:45,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:45,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:45,895 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:45,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:45,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:45,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:45,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:45,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,920 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:45,921 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:28:45,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2959 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:45,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:45,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:46,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:28:46,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:46,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2022-12-06 07:28:46,074 INFO L420 AbstractCegarLoop]: === Iteration 355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1289021574, now seen corresponding path program 1 times [2022-12-06 07:28:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325907282] [2022-12-06 07:28:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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:28:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325907282] [2022-12-06 07:28:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325907282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560981507] [2022-12-06 07:28:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:46,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:46,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:46,409 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:46,410 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:46,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:46,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:46,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:46,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:46,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:46,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:46,461 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:46,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:46,461 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:46,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:46,461 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:46,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:46,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:46,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:46,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:46,486 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:46,486 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:46,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:46,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:46,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:46,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:46,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:28:46,654 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:46,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:46,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:46,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2022-12-06 07:28:46,655 INFO L420 AbstractCegarLoop]: === Iteration 356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:46,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash 453788761, now seen corresponding path program 1 times [2022-12-06 07:28:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:46,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494513238] [2022-12-06 07:28:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:46,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:28:46,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:46,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494513238] [2022-12-06 07:28:46,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494513238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:46,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:46,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:46,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680728490] [2022-12-06 07:28:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:46,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:46,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:46,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:46,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,009 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:47,009 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:47,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:47,023 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:47,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:47,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:47,024 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:47,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:47,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,059 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:47,060 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:47,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,060 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:47,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,087 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:47,088 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:28:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2962 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:47,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:47,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:28:47,238 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:47,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2022-12-06 07:28:47,239 INFO L420 AbstractCegarLoop]: === Iteration 357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2098368200, now seen corresponding path program 1 times [2022-12-06 07:28:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013659259] [2022-12-06 07:28:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013659259] [2022-12-06 07:28:47,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013659259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802313719] [2022-12-06 07:28:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:47,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:47,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:47,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:47,587 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:47,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:47,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:47,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:47,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:47,602 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:47,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:47,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:47,648 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:47,648 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:47,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:47,648 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:47,648 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,674 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:47,674 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:28:47,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:47,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:47,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:47,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:47,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:28:47,814 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:47,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:47,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:47,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2022-12-06 07:28:47,814 INFO L420 AbstractCegarLoop]: === Iteration 358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:47,815 INFO L85 PathProgramCache]: Analyzing trace with hash -355557865, now seen corresponding path program 1 times [2022-12-06 07:28:47,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:47,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203740833] [2022-12-06 07:28:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:47,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:47,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:47,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203740833] [2022-12-06 07:28:47,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203740833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:47,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:47,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116292231] [2022-12-06 07:28:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:47,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:47,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:47,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:47,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:47,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,169 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:48,169 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:48,183 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:48,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:48,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:48,184 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:48,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:48,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:48,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:48,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,246 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:48,246 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:48,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:48,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:48,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:48,386 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:48,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2022-12-06 07:28:48,387 INFO L420 AbstractCegarLoop]: === Iteration 359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1387252470, now seen corresponding path program 1 times [2022-12-06 07:28:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41772298] [2022-12-06 07:28:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,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:28:48,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41772298] [2022-12-06 07:28:48,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41772298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:48,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552392692] [2022-12-06 07:28:48,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:48,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:48,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:48,715 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:48,715 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:48,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:48,729 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:48,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:48,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:48,730 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:48,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:48,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:48,767 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:48,767 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:48,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:48,767 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:48,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:48,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,793 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:48,793 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:48,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:48,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:48,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:48,938 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:48,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:28:48,939 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:48,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:48,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:48,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2022-12-06 07:28:48,939 INFO L420 AbstractCegarLoop]: === Iteration 360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1164904491, now seen corresponding path program 1 times [2022-12-06 07:28:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:48,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442919790] [2022-12-06 07:28:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:48,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442919790] [2022-12-06 07:28:48,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442919790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:48,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:48,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639807261] [2022-12-06 07:28:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:48,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:48,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:48,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:48,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:48,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:49,262 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:28:49,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:49,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:49,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:49,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:49,275 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:49,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:49,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,309 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:49,309 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:49,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,309 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,334 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:49,334 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:28:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:49,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:49,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:49,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:28:49,489 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:49,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:49,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:49,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2022-12-06 07:28:49,489 INFO L420 AbstractCegarLoop]: === Iteration 361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:49,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 577905844, now seen corresponding path program 1 times [2022-12-06 07:28:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:49,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117146794] [2022-12-06 07:28:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:49,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:49,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:28:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:49,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117146794] [2022-12-06 07:28:49,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117146794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:49,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:49,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379198998] [2022-12-06 07:28:49,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:49,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:49,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:49,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:49,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:49,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:49,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:49,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:49,826 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:28:49,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:49,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:49,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:49,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:49,840 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:49,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:49,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:49,875 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:49,875 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:49,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:49,875 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:49,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:49,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,900 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:49,901 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:28:49,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:49,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:49,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:50,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:28:50,053 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:50,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2022-12-06 07:28:50,053 INFO L420 AbstractCegarLoop]: === Iteration 362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1974251117, now seen corresponding path program 1 times [2022-12-06 07:28:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317264862] [2022-12-06 07:28:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,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:28:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317264862] [2022-12-06 07:28:50,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317264862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411818157] [2022-12-06 07:28:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:50,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:50,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,382 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:50,382 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:50,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:50,397 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:50,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:50,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:50,397 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:50,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:50,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:50,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:50,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:50,433 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:50,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:50,433 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:50,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:50,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:50,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:50,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:50,458 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:50,458 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:28:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:50,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:50,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:50,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:50,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:28:50,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:50,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:50,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2022-12-06 07:28:50,607 INFO L420 AbstractCegarLoop]: === Iteration 363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -231440782, now seen corresponding path program 1 times [2022-12-06 07:28:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:50,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419385845] [2022-12-06 07:28:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:50,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:28:50,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:50,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419385845] [2022-12-06 07:28:50,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419385845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:50,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:50,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512051119] [2022-12-06 07:28:50,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:50,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:50,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:50,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:50,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:50,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:50,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:50,962 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:50,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13549 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:50,976 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:50,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:50,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:50,976 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:50,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:51,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:51,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:51,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,011 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,036 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:51,036 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:51,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:51,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:51,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:28:51,184 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:51,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2022-12-06 07:28:51,185 INFO L420 AbstractCegarLoop]: === Iteration 364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:51,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1511369553, now seen corresponding path program 1 times [2022-12-06 07:28:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553281813] [2022-12-06 07:28:51,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,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:28:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553281813] [2022-12-06 07:28:51,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553281813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168729162] [2022-12-06 07:28:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:51,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:51,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:51,501 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:51,501 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:51,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:51,515 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:51,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:51,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:51,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:51,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:51,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:51,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:51,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:51,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:51,549 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:51,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:51,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,574 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:51,574 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:51,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:51,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:51,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:51,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:51,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:28:51,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:51,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:51,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:51,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2022-12-06 07:28:51,735 INFO L420 AbstractCegarLoop]: === Iteration 365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:51,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1040787408, now seen corresponding path program 1 times [2022-12-06 07:28:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:51,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432143387] [2022-12-06 07:28:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:51,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:28:51,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:51,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432143387] [2022-12-06 07:28:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432143387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:51,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:51,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589207433] [2022-12-06 07:28:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:51,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:51,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:51,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:51,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:51,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:51,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,099 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:52,099 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:52,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:52,116 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:52,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:52,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:52,116 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:52,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:52,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,154 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:52,154 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:52,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,154 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,179 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:52,180 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:28:52,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:52,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:52,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:28:52,332 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:52,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2022-12-06 07:28:52,333 INFO L420 AbstractCegarLoop]: === Iteration 366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 702022927, now seen corresponding path program 1 times [2022-12-06 07:28:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590001421] [2022-12-06 07:28:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:52,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:28:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:52,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590001421] [2022-12-06 07:28:52,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590001421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:52,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:52,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549051781] [2022-12-06 07:28:52,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:52,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:52,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:52,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:52,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:52,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:52,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:52,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:52,757 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:52,757 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:28:52,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:52,773 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:52,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:52,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:52,774 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:52,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:52,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:52,809 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:52,809 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:52,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:52,809 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:52,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:52,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,835 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:28:52,835 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:28:52,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:28:52,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:52,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:52,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:52,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:28:52,987 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:52,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:52,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2022-12-06 07:28:52,988 INFO L420 AbstractCegarLoop]: === Iteration 367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1850134034, now seen corresponding path program 1 times [2022-12-06 07:28:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:52,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362674323] [2022-12-06 07:28:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362674323] [2022-12-06 07:28:53,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362674323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544374535] [2022-12-06 07:28:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:53,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:53,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,370 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:53,370 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:53,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:53,387 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:53,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:53,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:53,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:53,388 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:53,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,422 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:53,422 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:53,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,422 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,448 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:53,448 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:28:53,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:53,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:53,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:53,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:28:53,592 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:53,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:53,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:53,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2022-12-06 07:28:53,593 INFO L420 AbstractCegarLoop]: === Iteration 368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -107323699, now seen corresponding path program 1 times [2022-12-06 07:28:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:53,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850610752] [2022-12-06 07:28:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:53,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:53,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:53,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850610752] [2022-12-06 07:28:53,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850610752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:53,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:53,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099400371] [2022-12-06 07:28:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:53,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:53,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:53,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:53,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:53,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:53,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:53,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:53,911 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:53,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:53,925 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:53,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:53,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:53,926 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:53,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:53,961 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:53,961 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:53,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:53,961 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:53,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:53,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,986 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:53,986 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:53,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:53,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:54,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:28:54,127 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:54,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2022-12-06 07:28:54,128 INFO L420 AbstractCegarLoop]: === Iteration 369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1635486636, now seen corresponding path program 1 times [2022-12-06 07:28:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089089964] [2022-12-06 07:28:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,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:28:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089089964] [2022-12-06 07:28:54,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089089964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828626948] [2022-12-06 07:28:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:54,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:54,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:54,491 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:54,491 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:28:54,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:54,503 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:54,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:54,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:54,504 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:54,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:54,534 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:54,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:54,534 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:54,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:54,534 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:54,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:54,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:54,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:54,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:54,559 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:54,560 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:28:54,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:54,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:54,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:54,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:54,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:28:54,703 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:54,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:54,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:54,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2022-12-06 07:28:54,703 INFO L420 AbstractCegarLoop]: === Iteration 370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash -916670325, now seen corresponding path program 1 times [2022-12-06 07:28:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:54,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194641781] [2022-12-06 07:28:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:54,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:28:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:54,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194641781] [2022-12-06 07:28:54,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194641781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:54,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:54,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903593802] [2022-12-06 07:28:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:54,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:54,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:54,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:54,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:54,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,032 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:55,032 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:28:55,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:55,046 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:55,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:55,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:55,047 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:55,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:55,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,083 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:55,083 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:55,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,083 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,108 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:55,109 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:28:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:55,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:55,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:28:55,260 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:55,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2022-12-06 07:28:55,261 INFO L420 AbstractCegarLoop]: === Iteration 371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash 826140010, now seen corresponding path program 1 times [2022-12-06 07:28:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674728551] [2022-12-06 07:28:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,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:28:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674728551] [2022-12-06 07:28:55,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674728551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512455177] [2022-12-06 07:28:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:55,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:55,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:55,597 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:55,598 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:55,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:55,616 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:55,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:55,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:55,617 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:55,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:55,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:55,659 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:55,659 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:55,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:55,659 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:55,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:55,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,685 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:55,685 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:28:55,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:55,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:55,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:55,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:55,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:28:55,829 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:55,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:55,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:55,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2022-12-06 07:28:55,830 INFO L420 AbstractCegarLoop]: === Iteration 372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1726016951, now seen corresponding path program 1 times [2022-12-06 07:28:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:55,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206746391] [2022-12-06 07:28:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:55,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206746391] [2022-12-06 07:28:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206746391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:55,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174322369] [2022-12-06 07:28:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:55,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:55,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:55,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:55,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:55,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,176 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:56,177 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:56,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13580 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:56,190 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:56,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:56,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:56,191 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:56,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:56,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,225 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:56,226 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:56,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,226 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,251 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:56,251 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:28:56,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:56,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:56,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:56,391 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:56,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2022-12-06 07:28:56,391 INFO L420 AbstractCegarLoop]: === Iteration 373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 16793384, now seen corresponding path program 1 times [2022-12-06 07:28:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445957686] [2022-12-06 07:28:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:56,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:28:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445957686] [2022-12-06 07:28:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445957686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:56,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:56,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622245286] [2022-12-06 07:28:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:56,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:56,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:56,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:56,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:56,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:56,733 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:56,733 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:56,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:56,746 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:56,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:56,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:56,747 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:56,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:56,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:56,782 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:56,783 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:56,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:56,783 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:56,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:56,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,808 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:56,808 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:28:56,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:56,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:56,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:56,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:56,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:28:56,948 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:56,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:56,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2022-12-06 07:28:56,948 INFO L420 AbstractCegarLoop]: === Iteration 374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1759603719, now seen corresponding path program 1 times [2022-12-06 07:28:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239253182] [2022-12-06 07:28:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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:28:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239253182] [2022-12-06 07:28:57,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239253182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431427132] [2022-12-06 07:28:57,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:57,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:57,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,273 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:57,273 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:28:57,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13585 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:57,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:57,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:57,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:57,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:57,287 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:57,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:57,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,323 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:57,323 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:57,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,349 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:57,349 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:28:57,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:57,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:57,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:57,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:28:57,490 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:57,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:57,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:57,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2022-12-06 07:28:57,490 INFO L420 AbstractCegarLoop]: === Iteration 375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:57,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -792553242, now seen corresponding path program 1 times [2022-12-06 07:28:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:57,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659408932] [2022-12-06 07:28:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:57,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:28:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659408932] [2022-12-06 07:28:57,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659408932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:57,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:57,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405326351] [2022-12-06 07:28:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:57,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:57,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:57,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:57,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:57,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:57,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:57,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:57,841 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:57,841 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:57,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:57,855 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:57,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:57,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:57,856 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:57,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:57,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:57,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:57,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:57,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:57,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:57,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:57,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,918 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:57,918 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:57,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:57,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:57,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:58,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:28:58,066 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:58,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2022-12-06 07:28:58,067 INFO L420 AbstractCegarLoop]: === Iteration 376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash 950257093, now seen corresponding path program 1 times [2022-12-06 07:28:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346587004] [2022-12-06 07:28:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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:28:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346587004] [2022-12-06 07:28:58,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346587004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969437554] [2022-12-06 07:28:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:58,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:58,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,414 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:58,414 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:58,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:58,428 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:58,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:58,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:58,429 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:58,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:58,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:58,468 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:58,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:58,468 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:58,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:58,468 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:58,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:58,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:58,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:58,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:58,496 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:58,496 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:28:58,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:58,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:58,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:58,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:58,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:28:58,654 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:58,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:58,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:58,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2022-12-06 07:28:58,654 INFO L420 AbstractCegarLoop]: === Iteration 377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1601899868, now seen corresponding path program 1 times [2022-12-06 07:28:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:58,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229200205] [2022-12-06 07:28:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:58,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:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:58,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229200205] [2022-12-06 07:28:58,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229200205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:58,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:58,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:58,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555496233] [2022-12-06 07:28:58,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:58,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:58,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:58,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:58,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:58,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:58,997 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:58,997 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:28:59,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:59,011 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:59,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:59,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:59,012 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:59,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,047 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:59,047 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:59,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,073 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:59,073 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:28:59,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:59,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:59,225 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:28:59,226 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:59,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2022-12-06 07:28:59,226 INFO L420 AbstractCegarLoop]: === Iteration 378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 140910467, now seen corresponding path program 1 times [2022-12-06 07:28:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916579404] [2022-12-06 07:28:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:59,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:28:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916579404] [2022-12-06 07:28:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916579404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:59,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044667878] [2022-12-06 07:28:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:59,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:59,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:59,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:28:59,555 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:28:59,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:28:59,569 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:28:59,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:28:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:28:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:28:59,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:28:59,570 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:28:59,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:28:59,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:28:59,607 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:28:59,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:28:59,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:59,607 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:59,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:59,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,632 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:28:59,632 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:28:59,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:28:59,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:28:59,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:28:59,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:59,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:28:59,771 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:28:59,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:59,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:59,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2022-12-06 07:28:59,771 INFO L420 AbstractCegarLoop]: === Iteration 379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1883720802, now seen corresponding path program 1 times [2022-12-06 07:28:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742557246] [2022-12-06 07:28:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28: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:28:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:59,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742557246] [2022-12-06 07:28:59,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742557246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:59,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:59,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230113495] [2022-12-06 07:28:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:28:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:28:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:28:59,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:28:59,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:59,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:28:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,092 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:00,092 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:00,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:00,106 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:00,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:00,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:00,106 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:00,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:00,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,142 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:00,143 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:00,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,143 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,168 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:00,168 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:29:00,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:00,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:00,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:29:00,319 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:00,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2022-12-06 07:29:00,319 INFO L420 AbstractCegarLoop]: === Iteration 380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -668436159, now seen corresponding path program 1 times [2022-12-06 07:29:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486367933] [2022-12-06 07:29:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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:29:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486367933] [2022-12-06 07:29:00,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486367933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088250481] [2022-12-06 07:29:00,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:00,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:00,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:00,660 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:00,660 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:00,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:00,674 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:00,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:00,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:00,675 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:00,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:00,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:00,711 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:00,711 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:00,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:00,712 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:00,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:00,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,737 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:00,737 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:29:00,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:00,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:00,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:00,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:00,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:29:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:00,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:00,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:00,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2022-12-06 07:29:00,887 INFO L420 AbstractCegarLoop]: === Iteration 381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1074374176, now seen corresponding path program 1 times [2022-12-06 07:29:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:00,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013293624] [2022-12-06 07:29:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:00,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:29:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:00,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013293624] [2022-12-06 07:29:00,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013293624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:00,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:00,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671048855] [2022-12-06 07:29:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:00,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:00,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:00,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:00,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:00,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,213 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:01,213 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:01,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13587 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:01,226 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:01,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:01,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:01,227 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:01,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:01,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:01,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:01,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,262 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,287 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:01,287 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:29:01,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:01,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:01,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:29:01,424 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:01,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2022-12-06 07:29:01,425 INFO L420 AbstractCegarLoop]: === Iteration 382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1477782785, now seen corresponding path program 1 times [2022-12-06 07:29:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101435640] [2022-12-06 07:29:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:01,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:29:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:01,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101435640] [2022-12-06 07:29:01,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101435640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:01,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:01,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276394867] [2022-12-06 07:29:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:01,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:01,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:01,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:01,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:01,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:01,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:01,763 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:01,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:01,776 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:01,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:01,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:01,777 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:01,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:01,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:01,811 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:01,811 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:01,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:01,811 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:01,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:01,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,836 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:01,837 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:29:01,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:01,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:01,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:01,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:01,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:29:01,975 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:01,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:01,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:01,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2022-12-06 07:29:01,975 INFO L420 AbstractCegarLoop]: === Iteration 383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash 265027550, now seen corresponding path program 1 times [2022-12-06 07:29:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:01,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624972296] [2022-12-06 07:29:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624972296] [2022-12-06 07:29:02,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624972296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493623313] [2022-12-06 07:29:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:02,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:02,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,321 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:02,321 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:02,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:02,334 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:02,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:02,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:02,335 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:02,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:02,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,369 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:02,369 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:02,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,369 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,394 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:02,394 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:02,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:02,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:02,529 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:02,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:29:02,529 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:02,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:02,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:02,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2022-12-06 07:29:02,530 INFO L420 AbstractCegarLoop]: === Iteration 384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2007837885, now seen corresponding path program 1 times [2022-12-06 07:29:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:02,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688886081] [2022-12-06 07:29:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:02,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:29:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:02,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688886081] [2022-12-06 07:29:02,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688886081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:02,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:02,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497428854] [2022-12-06 07:29:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:02,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:02,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:02,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:02,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:02,864 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:02,864 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:02,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:02,878 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:02,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:02,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:02,879 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:02,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:02,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:02,916 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:02,916 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:02,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:02,916 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,916 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:02,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:02,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,941 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:02,941 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:02,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:02,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:02,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:03,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:29:03,090 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:03,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2022-12-06 07:29:03,090 INFO L420 AbstractCegarLoop]: === Iteration 385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -544319076, now seen corresponding path program 1 times [2022-12-06 07:29:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221104771] [2022-12-06 07:29:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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:29:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221104771] [2022-12-06 07:29:03,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221104771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318906859] [2022-12-06 07:29:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:03,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:03,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,416 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:03,417 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:03,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:03,430 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:03,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:03,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:03,431 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:03,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:03,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:03,468 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:03,468 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:03,468 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:03,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:03,468 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:03,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:03,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:03,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:03,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:03,496 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:03,496 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:29:03,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:03,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:03,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:03,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:03,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:29:03,640 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:03,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:03,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:03,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2022-12-06 07:29:03,640 INFO L420 AbstractCegarLoop]: === Iteration 386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1198491259, now seen corresponding path program 1 times [2022-12-06 07:29:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:03,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588507222] [2022-12-06 07:29:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:03,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:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:03,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588507222] [2022-12-06 07:29:03,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588507222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:03,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:03,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842741414] [2022-12-06 07:29:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:03,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:03,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:03,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:03,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:03,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:03,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:03,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:03,977 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:03,978 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:03,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:03,990 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:03,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:03,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:03,991 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:03,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:04,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,027 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:04,027 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:04,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,027 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,052 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:04,052 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:29:04,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:04,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:04,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:29:04,196 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:04,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2022-12-06 07:29:04,196 INFO L420 AbstractCegarLoop]: === Iteration 387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1353665702, now seen corresponding path program 1 times [2022-12-06 07:29:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309103726] [2022-12-06 07:29:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309103726] [2022-12-06 07:29:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309103726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406362681] [2022-12-06 07:29:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:04,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:04,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:04,537 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:04,538 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:04,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:04,551 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:04,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:04,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:04,551 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:04,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:04,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:04,587 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:04,587 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:04,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:04,587 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:04,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:04,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,612 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:04,612 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:04,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:04,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:04,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:04,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:04,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:29:04,765 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:04,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:04,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:04,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2022-12-06 07:29:04,765 INFO L420 AbstractCegarLoop]: === Iteration 388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash 389144633, now seen corresponding path program 1 times [2022-12-06 07:29:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:04,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296269494] [2022-12-06 07:29:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:04,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:29:04,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:04,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296269494] [2022-12-06 07:29:04,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296269494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:04,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:04,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425720871] [2022-12-06 07:29:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:04,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:04,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:04,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:04,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:05,098 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:05,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:05,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:05,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:05,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:05,112 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:05,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:05,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,149 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:05,150 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:05,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,150 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,175 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:05,175 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:05,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:05,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:05,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:29:05,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:05,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2022-12-06 07:29:05,321 INFO L420 AbstractCegarLoop]: === Iteration 389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2131954968, now seen corresponding path program 1 times [2022-12-06 07:29:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842450972] [2022-12-06 07:29:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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:29:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842450972] [2022-12-06 07:29:05,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842450972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831637439] [2022-12-06 07:29:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:05,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:05,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:05,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:05,674 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:05,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:05,688 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:05,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:05,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:05,689 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:05,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:05,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:05,725 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:05,726 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:05,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:05,726 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:05,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:05,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,752 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:05,752 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:29:05,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:05,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:05,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:05,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:05,906 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:29:05,906 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:05,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:05,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:05,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2022-12-06 07:29:05,906 INFO L420 AbstractCegarLoop]: === Iteration 390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash -420201993, now seen corresponding path program 1 times [2022-12-06 07:29:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:05,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224394821] [2022-12-06 07:29:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:05,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:05,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:29:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224394821] [2022-12-06 07:29:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224394821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:05,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362223986] [2022-12-06 07:29:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:05,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:05,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:05,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:05,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:05,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,245 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:06,245 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:06,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:06,258 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:06,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:06,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:06,259 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:06,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:06,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,294 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:06,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:06,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,294 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,319 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:06,319 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:29:06,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:06,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:06,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:06,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:29:06,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:06,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:06,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:06,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2022-12-06 07:29:06,467 INFO L420 AbstractCegarLoop]: === Iteration 391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1322608342, now seen corresponding path program 1 times [2022-12-06 07:29:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:06,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588389739] [2022-12-06 07:29:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:06,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:29:06,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:06,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588389739] [2022-12-06 07:29:06,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588389739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:06,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:06,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385250510] [2022-12-06 07:29:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:06,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:06,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:06,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:06,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:06,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:06,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:06,834 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:06,834 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:06,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:06,850 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:06,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:06,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:06,851 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:06,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:06,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:06,888 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:06,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:06,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:06,889 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:06,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:06,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,914 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:06,914 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:06,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:06,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:06,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:07,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:29:07,072 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:07,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2022-12-06 07:29:07,072 INFO L420 AbstractCegarLoop]: === Iteration 392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1229548619, now seen corresponding path program 1 times [2022-12-06 07:29:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262868753] [2022-12-06 07:29:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262868753] [2022-12-06 07:29:07,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262868753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046113446] [2022-12-06 07:29:07,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:07,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:07,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:07,420 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:07,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:07,433 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:07,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:07,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:07,434 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:07,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:07,472 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:07,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:07,473 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:07,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:07,473 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:07,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:07,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:07,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:07,499 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:07,500 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:07,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:07,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:07,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:07,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:07,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:29:07,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:07,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2022-12-06 07:29:07,666 INFO L420 AbstractCegarLoop]: === Iteration 393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 513261716, now seen corresponding path program 1 times [2022-12-06 07:29:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378933820] [2022-12-06 07:29:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:07,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:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:07,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378933820] [2022-12-06 07:29:07,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378933820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:07,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283643682] [2022-12-06 07:29:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:07,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:07,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:07,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:07,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:07,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:07,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:07,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,004 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:08,004 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:08,018 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:08,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:08,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:08,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:08,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:08,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,055 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:08,055 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:08,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,055 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,080 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:08,080 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:08,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:08,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:29:08,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:08,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2022-12-06 07:29:08,242 INFO L420 AbstractCegarLoop]: === Iteration 394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2038895245, now seen corresponding path program 1 times [2022-12-06 07:29:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041593175] [2022-12-06 07:29:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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:29:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041593175] [2022-12-06 07:29:08,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041593175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444818133] [2022-12-06 07:29:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:08,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:08,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:08,573 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:08,573 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:08,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:08,587 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:08,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:08,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:08,588 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:08,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:08,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:08,624 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:08,624 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:08,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:08,624 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:08,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:08,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,649 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:08,649 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:29:08,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:08,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:08,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:08,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:08,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:29:08,805 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:08,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:08,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:08,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2022-12-06 07:29:08,806 INFO L420 AbstractCegarLoop]: === Iteration 395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash -296084910, now seen corresponding path program 1 times [2022-12-06 07:29:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:08,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295667429] [2022-12-06 07:29:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:08,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:29:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:08,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295667429] [2022-12-06 07:29:08,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295667429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:08,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:08,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933776207] [2022-12-06 07:29:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:08,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:08,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:08,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:08,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:08,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,153 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:09,153 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:09,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:09,166 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:09,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:09,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:09,167 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:09,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:09,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,204 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:09,204 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:09,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,204 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,230 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:09,230 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:09,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:09,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:09,395 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:29:09,396 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:09,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2022-12-06 07:29:09,396 INFO L420 AbstractCegarLoop]: === Iteration 396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1446725425, now seen corresponding path program 1 times [2022-12-06 07:29:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467359300] [2022-12-06 07:29:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:09,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:29:09,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467359300] [2022-12-06 07:29:09,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467359300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:09,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806817514] [2022-12-06 07:29:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:09,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:09,707 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:09,708 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:09,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:09,720 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:09,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:09,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:09,721 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:09,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:09,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:09,759 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:09,759 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:09,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:09,759 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:09,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:09,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,785 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:09,785 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:29:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:09,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:09,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:09,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:09,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:09,925 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:09,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:09,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2022-12-06 07:29:09,925 INFO L420 AbstractCegarLoop]: === Iteration 397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1105431536, now seen corresponding path program 1 times [2022-12-06 07:29:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:09,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146919930] [2022-12-06 07:29:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:09,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:29:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:09,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146919930] [2022-12-06 07:29:09,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146919930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:09,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:09,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457437078] [2022-12-06 07:29:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:09,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:09,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:09,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:09,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:09,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:09,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:09,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:09,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,250 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:10,251 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:10,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:10,264 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:10,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:10,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:10,265 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:10,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:10,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:10,302 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:10,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,328 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:10,328 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:10,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:10,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:10,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:10,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:29:10,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:10,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:10,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:10,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2022-12-06 07:29:10,467 INFO L420 AbstractCegarLoop]: === Iteration 398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 637378799, now seen corresponding path program 1 times [2022-12-06 07:29:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:10,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740170419] [2022-12-06 07:29:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:10,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:29:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740170419] [2022-12-06 07:29:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740170419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:10,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728255617] [2022-12-06 07:29:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:10,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:10,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:10,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:10,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:10,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:10,812 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:10,812 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:10,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:10,825 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:10,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:10,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:10,826 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:10,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:10,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:10,863 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:10,864 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:10,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:10,864 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:10,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:10,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,889 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:10,890 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:10,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:10,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:10,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:11,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:29:11,031 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:11,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2022-12-06 07:29:11,031 INFO L420 AbstractCegarLoop]: === Iteration 399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1914778162, now seen corresponding path program 1 times [2022-12-06 07:29:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123422511] [2022-12-06 07:29:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,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:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123422511] [2022-12-06 07:29:11,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123422511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144018731] [2022-12-06 07:29:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:11,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:11,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,344 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:11,344 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:29:11,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:11,357 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:11,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:11,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:11,358 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:11,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:11,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,391 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:11,391 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:11,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,391 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,416 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:11,416 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:29:11,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:11,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:11,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:11,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:11,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:11,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:11,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:11,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2022-12-06 07:29:11,557 INFO L420 AbstractCegarLoop]: === Iteration 400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -171967827, now seen corresponding path program 1 times [2022-12-06 07:29:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110328920] [2022-12-06 07:29:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110328920] [2022-12-06 07:29:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110328920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103387772] [2022-12-06 07:29:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:11,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:11,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:11,873 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:11,873 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:11,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:11,886 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:11,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:11,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:11,887 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:11,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:11,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:11,918 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:11,919 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:11,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:11,919 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:11,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:11,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,944 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:11,944 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:29:11,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:11,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:11,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:12,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:29:12,092 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:12,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2022-12-06 07:29:12,092 INFO L420 AbstractCegarLoop]: === Iteration 401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:12,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1570842508, now seen corresponding path program 1 times [2022-12-06 07:29:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538209529] [2022-12-06 07:29:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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:29:12,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538209529] [2022-12-06 07:29:12,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538209529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323016385] [2022-12-06 07:29:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:12,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:12,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,412 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:12,412 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:12,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:12,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:12,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:12,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:12,425 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:12,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:12,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,465 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:12,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:12,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:12,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:12,466 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:12,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:12,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:12,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:12,491 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:12,491 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:12,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:12,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:12,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:12,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:12,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:29:12,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:12,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:12,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2022-12-06 07:29:12,634 INFO L420 AbstractCegarLoop]: === Iteration 402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -981314453, now seen corresponding path program 1 times [2022-12-06 07:29:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:12,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374507231] [2022-12-06 07:29:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:12,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:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:12,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374507231] [2022-12-06 07:29:12,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374507231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:12,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:12,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:12,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580737357] [2022-12-06 07:29:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:12,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:12,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:12,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:12,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,955 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:12,955 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:12,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:12,968 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:12,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:12,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:12,969 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:12,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:13,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:13,014 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:13,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,014 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,039 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:13,040 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:13,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:13,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:13,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:29:13,188 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:13,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2022-12-06 07:29:13,188 INFO L420 AbstractCegarLoop]: === Iteration 403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 761495882, now seen corresponding path program 1 times [2022-12-06 07:29:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368523193] [2022-12-06 07:29:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:13,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:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368523193] [2022-12-06 07:29:13,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368523193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548918499] [2022-12-06 07:29:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:13,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:13,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:13,513 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:13,514 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:13,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:13,528 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:13,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:13,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:13,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:13,528 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:13,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:13,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:13,565 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:13,565 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:13,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:13,565 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:13,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:13,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,590 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:13,590 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:29:13,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:13,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:13,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:13,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:13,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:29:13,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:13,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:13,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:13,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2022-12-06 07:29:13,754 INFO L420 AbstractCegarLoop]: === Iteration 404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1790661079, now seen corresponding path program 1 times [2022-12-06 07:29:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:13,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215392368] [2022-12-06 07:29:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:13,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:29:13,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215392368] [2022-12-06 07:29:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215392368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:13,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905376234] [2022-12-06 07:29:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:13,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:13,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:13,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:13,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:13,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:13,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,115 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:14,115 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:14,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:14,130 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:14,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:14,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:14,131 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:14,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:14,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,171 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:14,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:14,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,171 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,197 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:14,197 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:29:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:14,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:14,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:29:14,352 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:14,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2022-12-06 07:29:14,352 INFO L420 AbstractCegarLoop]: === Iteration 405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash -47850744, now seen corresponding path program 1 times [2022-12-06 07:29:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518949640] [2022-12-06 07:29:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,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:29:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518949640] [2022-12-06 07:29:14,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518949640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236247206] [2022-12-06 07:29:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:14,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:14,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:14,679 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:14,679 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:14,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:14,692 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:14,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:14,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:14,693 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:14,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:14,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:14,728 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:14,728 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:14,729 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:14,729 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:14,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:14,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,754 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:14,754 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:29:14,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:14,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:14,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:14,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:14,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:29:14,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:14,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:14,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:14,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2022-12-06 07:29:14,894 INFO L420 AbstractCegarLoop]: === Iteration 406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1694959591, now seen corresponding path program 1 times [2022-12-06 07:29:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:14,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248090784] [2022-12-06 07:29:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:14,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:29:14,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:14,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248090784] [2022-12-06 07:29:14,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248090784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:14,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:14,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484635099] [2022-12-06 07:29:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:14,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:14,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:14,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:14,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:14,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,233 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:15,233 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:15,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:15,247 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:15,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:15,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:15,248 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:15,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:15,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,284 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:15,284 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:15,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,284 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,309 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:15,310 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:15,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:15,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:15,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:15,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:29:15,453 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:15,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:15,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:15,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2022-12-06 07:29:15,453 INFO L420 AbstractCegarLoop]: === Iteration 407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:15,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash -857197370, now seen corresponding path program 1 times [2022-12-06 07:29:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:15,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833250850] [2022-12-06 07:29:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:15,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:29:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:15,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833250850] [2022-12-06 07:29:15,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833250850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:15,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:15,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675129369] [2022-12-06 07:29:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:15,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:15,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:15,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:15,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:15,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:15,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:15,800 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:15,800 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:15,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:15,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:15,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:15,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:15,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:15,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:15,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:15,850 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:15,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:15,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:15,850 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:15,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:15,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,875 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:15,875 INFO L131 PetriNetUnfolder]: For 3112/3253 co-relation queries the response was YES. [2022-12-06 07:29:15,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3112/3253 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:15,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:15,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:16,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:29:16,013 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:16,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2022-12-06 07:29:16,013 INFO L420 AbstractCegarLoop]: === Iteration 408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:16,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash 885612965, now seen corresponding path program 1 times [2022-12-06 07:29:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817799609] [2022-12-06 07:29:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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:29:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817799609] [2022-12-06 07:29:16,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817799609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622582069] [2022-12-06 07:29:16,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:16,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:16,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,335 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:16,335 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:16,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:16,349 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:16,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:16,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:16,350 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:16,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,387 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:16,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:16,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,388 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,413 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:16,413 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:16,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:16,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:16,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:16,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:16,554 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:16,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:16,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2022-12-06 07:29:16,554 INFO L420 AbstractCegarLoop]: === Iteration 409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1666543996, now seen corresponding path program 1 times [2022-12-06 07:29:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:16,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284570986] [2022-12-06 07:29:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:16,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:16,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:29:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:16,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284570986] [2022-12-06 07:29:16,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284570986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:16,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:16,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915659797] [2022-12-06 07:29:16,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:16,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:16,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:16,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:16,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:16,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:16,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:16,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:16,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:16,905 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:16,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:16,920 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:16,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:16,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:16,920 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:16,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:16,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:16,953 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:16,953 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:16,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:16,954 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:16,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:16,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,979 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:16,979 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:29:16,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:16,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:16,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:17,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:29:17,129 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:17,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2022-12-06 07:29:17,129 INFO L420 AbstractCegarLoop]: === Iteration 410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash 76266339, now seen corresponding path program 1 times [2022-12-06 07:29:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827144318] [2022-12-06 07:29:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:17,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:29:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827144318] [2022-12-06 07:29:17,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827144318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131579783] [2022-12-06 07:29:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:17,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:17,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:17,490 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:17,490 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:17,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:17,504 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:17,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:17,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:17,505 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:17,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:17,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:17,541 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:17,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:17,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:17,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:17,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:17,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:17,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:17,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:17,567 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:17,568 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:29:17,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:17,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:17,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:17,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:17,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:29:17,717 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:17,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:17,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:17,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2022-12-06 07:29:17,717 INFO L420 AbstractCegarLoop]: === Iteration 411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1819076674, now seen corresponding path program 1 times [2022-12-06 07:29:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:17,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578435348] [2022-12-06 07:29:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:17,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578435348] [2022-12-06 07:29:17,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578435348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:17,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658605] [2022-12-06 07:29:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:17,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:17,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:17,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:17,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,065 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:18,065 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:18,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:18,079 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:18,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:18,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:18,079 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:18,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,114 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:18,114 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:18,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,114 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,139 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:18,139 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:29:18,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:18,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:18,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:29:18,279 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:18,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2022-12-06 07:29:18,279 INFO L420 AbstractCegarLoop]: === Iteration 412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -733080287, now seen corresponding path program 1 times [2022-12-06 07:29:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712110032] [2022-12-06 07:29:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:18,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712110032] [2022-12-06 07:29:18,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712110032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:18,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634931208] [2022-12-06 07:29:18,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:18,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:18,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:18,615 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:18,615 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:18,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:18,628 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:18,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:18,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:18,629 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:18,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:18,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:18,665 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:18,665 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:18,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:18,665 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:18,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:18,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:18,690 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:18,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:18,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:18,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:18,836 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:18,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:29:18,836 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:18,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:18,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:18,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2022-12-06 07:29:18,836 INFO L420 AbstractCegarLoop]: === Iteration 413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1009730048, now seen corresponding path program 1 times [2022-12-06 07:29:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:18,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872320692] [2022-12-06 07:29:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:18,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:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:18,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872320692] [2022-12-06 07:29:18,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872320692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:18,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:18,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389868257] [2022-12-06 07:29:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:18,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:18,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:18,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:18,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:18,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:18,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:18,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,154 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:19,154 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:19,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:19,167 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:19,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:19,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:19,168 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:19,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:19,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,202 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:19,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:19,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,227 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:19,228 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:19,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:19,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:19,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:29:19,364 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:19,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2022-12-06 07:29:19,364 INFO L420 AbstractCegarLoop]: === Iteration 414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1542426913, now seen corresponding path program 1 times [2022-12-06 07:29:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96213386] [2022-12-06 07:29:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96213386] [2022-12-06 07:29:19,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96213386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894028845] [2022-12-06 07:29:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:19,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:19,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:19,692 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:19,692 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:19,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:19,706 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:19,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:19,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:19,706 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:19,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:19,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:19,741 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:19,741 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:19,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:19,741 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:19,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:19,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,766 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:19,766 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:19,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:19,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:19,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:19,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:19,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:29:19,926 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:19,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:19,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:19,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2022-12-06 07:29:19,926 INFO L420 AbstractCegarLoop]: === Iteration 415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 200383422, now seen corresponding path program 1 times [2022-12-06 07:29:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:19,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551492093] [2022-12-06 07:29:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:19,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:29:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:19,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551492093] [2022-12-06 07:29:19,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551492093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:19,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:19,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416384717] [2022-12-06 07:29:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:19,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:19,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:19,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:19,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:19,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,272 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:20,273 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:20,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:20,285 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:20,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:20,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:20,286 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:20,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:20,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:20,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:20,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,344 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:20,344 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:29:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3009 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:20,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:20,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:20,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:29:20,485 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:20,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:20,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:20,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2022-12-06 07:29:20,486 INFO L420 AbstractCegarLoop]: === Iteration 416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1943193757, now seen corresponding path program 1 times [2022-12-06 07:29:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:20,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036928963] [2022-12-06 07:29:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:20,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:29:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036928963] [2022-12-06 07:29:20,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036928963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:20,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:20,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642717405] [2022-12-06 07:29:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:20,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:20,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:20,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:20,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:20,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:20,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:20,818 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:20,818 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:20,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:20,831 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:20,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:20,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:20,832 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:20,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:20,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:20,863 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:20,863 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:20,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:20,863 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:20,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:20,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,894 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:20,894 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:29:20,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:20,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:20,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:21,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:29:21,045 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:21,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2022-12-06 07:29:21,045 INFO L420 AbstractCegarLoop]: === Iteration 417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -608963204, now seen corresponding path program 1 times [2022-12-06 07:29:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585835792] [2022-12-06 07:29:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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:29:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585835792] [2022-12-06 07:29:21,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585835792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393926005] [2022-12-06 07:29:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:21,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:21,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,355 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:21,355 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:21,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:21,367 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:21,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:21,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:21,368 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:21,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:21,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:21,407 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:21,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:21,408 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:21,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:21,408 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:21,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:21,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:21,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:21,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:21,433 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:21,433 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:29:21,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:21,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:21,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:21,578 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:21,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:29:21,578 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:21,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:21,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:21,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2022-12-06 07:29:21,579 INFO L420 AbstractCegarLoop]: === Iteration 418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:21,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1133847131, now seen corresponding path program 1 times [2022-12-06 07:29:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:21,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582774739] [2022-12-06 07:29:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:21,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:21,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:29:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582774739] [2022-12-06 07:29:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582774739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:21,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:21,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265524569] [2022-12-06 07:29:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:21,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:21,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:21,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:21,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:21,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:21,951 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:21,952 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13497 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:21,966 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:21,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:21,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:21,967 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:21,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:22,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,003 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:22,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:22,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,003 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,036 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:22,036 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:22,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:22,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:22,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:29:22,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:22,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2022-12-06 07:29:22,176 INFO L420 AbstractCegarLoop]: === Iteration 419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:22,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1418309830, now seen corresponding path program 1 times [2022-12-06 07:29:22,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055395773] [2022-12-06 07:29:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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:29:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055395773] [2022-12-06 07:29:22,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055395773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408437232] [2022-12-06 07:29:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:22,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:22,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:22,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:22,516 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:22,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:22,532 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:22,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:22,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:22,533 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:22,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:22,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:22,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:22,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:22,568 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:22,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:22,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,592 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:22,593 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:29:22,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:22,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:22,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:22,736 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:22,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:29:22,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:22,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:22,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2022-12-06 07:29:22,736 INFO L420 AbstractCegarLoop]: === Iteration 420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash 324500505, now seen corresponding path program 1 times [2022-12-06 07:29:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866205678] [2022-12-06 07:29:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:22,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:29:22,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:22,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866205678] [2022-12-06 07:29:22,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866205678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:22,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:22,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893829974] [2022-12-06 07:29:22,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:22,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:22,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:22,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:22,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:22,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:22,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:23,070 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:23,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:23,084 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:23,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:23,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:23,085 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:23,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:23,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:23,123 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:23,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,123 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,154 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:23,154 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:23,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:23,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:29:23,305 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:23,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2022-12-06 07:29:23,306 INFO L420 AbstractCegarLoop]: === Iteration 421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2067310840, now seen corresponding path program 1 times [2022-12-06 07:29:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649384490] [2022-12-06 07:29:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,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:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649384490] [2022-12-06 07:29:23,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649384490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:23,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53143783] [2022-12-06 07:29:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:23,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:23,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:23,641 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:23,641 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:23,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:23,655 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:23,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:23,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:23,656 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:23,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:23,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:23,691 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:23,692 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:23,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:23,692 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:23,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:23,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,718 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:23,718 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:23,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:23,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:23,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:23,859 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:23,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:29:23,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:23,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:23,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:23,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2022-12-06 07:29:23,859 INFO L420 AbstractCegarLoop]: === Iteration 422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:23,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash -484846121, now seen corresponding path program 1 times [2022-12-06 07:29:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:23,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343851946] [2022-12-06 07:29:23,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:23,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:29:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343851946] [2022-12-06 07:29:23,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343851946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:23,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:23,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626701318] [2022-12-06 07:29:23,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:23,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:23,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:23,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:23,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:23,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:23,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,215 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:24,216 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:24,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:24,230 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:24,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:24,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:24,231 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:24,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:24,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,267 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:24,268 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:24,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,268 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,298 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:24,298 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:29:24,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:24,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:24,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:24,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:29:24,445 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:24,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:24,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:24,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2022-12-06 07:29:24,446 INFO L420 AbstractCegarLoop]: === Iteration 423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1257964214, now seen corresponding path program 1 times [2022-12-06 07:29:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:24,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510732308] [2022-12-06 07:29:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:24,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:29:24,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:24,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510732308] [2022-12-06 07:29:24,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510732308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:24,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:24,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830031973] [2022-12-06 07:29:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:24,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:24,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:24,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:24,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:24,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:24,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:24,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:24,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:24,790 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:24,791 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:24,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:24,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:24,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:24,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:24,806 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:24,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:24,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:24,851 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:24,851 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:24,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:24,851 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:24,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:24,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,877 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:24,877 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:24,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:24,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:25,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:29:25,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:25,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2022-12-06 07:29:25,029 INFO L420 AbstractCegarLoop]: === Iteration 424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1294192747, now seen corresponding path program 1 times [2022-12-06 07:29:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711601172] [2022-12-06 07:29:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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:29:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711601172] [2022-12-06 07:29:25,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711601172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944726300] [2022-12-06 07:29:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:25,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:25,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,350 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:25,351 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:25,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:25,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:25,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:25,365 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:25,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:25,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,401 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:25,402 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:25,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,402 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,431 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:25,431 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:29:25,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:25,434 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,434 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:25,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:25,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:29:25,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:25,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:25,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:25,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2022-12-06 07:29:25,587 INFO L420 AbstractCegarLoop]: === Iteration 425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 448617588, now seen corresponding path program 1 times [2022-12-06 07:29:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:25,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456290119] [2022-12-06 07:29:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:25,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:25,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:25,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456290119] [2022-12-06 07:29:25,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456290119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:25,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:25,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487294714] [2022-12-06 07:29:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:25,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:25,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:25,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:25,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:25,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:25,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:25,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:25,928 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:25,928 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:25,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:25,943 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:25,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:25,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:25,944 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:25,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:25,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:25,980 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:25,980 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:25,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:25,980 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:25,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:25,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:25,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,006 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:26,006 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:26,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:26,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:26,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:29:26,141 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:26,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2022-12-06 07:29:26,142 INFO L420 AbstractCegarLoop]: === Iteration 426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2103539373, now seen corresponding path program 1 times [2022-12-06 07:29:26,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139586545] [2022-12-06 07:29:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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:26,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139586545] [2022-12-06 07:29:26,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139586545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75927236] [2022-12-06 07:29:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:26,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:26,491 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:26,492 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:29:26,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:26,505 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:26,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:26,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:26,506 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:26,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:26,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:26,557 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:26,557 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:26,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:26,557 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:26,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:26,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,583 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:26,583 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:29:26,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:26,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:26,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:26,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:26,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:29:26,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:26,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:26,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:26,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2022-12-06 07:29:26,732 INFO L420 AbstractCegarLoop]: === Iteration 427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash -360729038, now seen corresponding path program 1 times [2022-12-06 07:29:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:26,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965578197] [2022-12-06 07:29:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:26,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:29:26,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:26,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965578197] [2022-12-06 07:29:26,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965578197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:26,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:26,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266956272] [2022-12-06 07:29:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:26,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:26,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:26,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:26,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:26,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:26,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:26,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,074 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:27,074 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:27,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:27,089 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:27,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:27,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:27,090 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:27,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:27,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,125 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:27,125 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:27,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,125 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,151 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:27,152 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:27,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:27,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:27,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:29:27,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:27,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2022-12-06 07:29:27,292 INFO L420 AbstractCegarLoop]: === Iteration 428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1382081297, now seen corresponding path program 1 times [2022-12-06 07:29:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364316771] [2022-12-06 07:29:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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:29:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364316771] [2022-12-06 07:29:27,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364316771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868540816] [2022-12-06 07:29:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:27,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:27,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:27,663 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:27,664 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:27,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:27,675 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:27,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:27,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:27,676 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:27,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:27,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:27,708 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:27,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:27,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:27,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:27,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:27,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,734 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:27,734 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:27,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:27,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:27,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:27,879 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:27,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:29:27,880 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:27,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:27,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:27,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2022-12-06 07:29:27,880 INFO L420 AbstractCegarLoop]: === Iteration 429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1170075664, now seen corresponding path program 1 times [2022-12-06 07:29:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:27,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846716139] [2022-12-06 07:29:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:27,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:29:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846716139] [2022-12-06 07:29:27,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846716139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:27,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:27,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15014762] [2022-12-06 07:29:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:27,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:27,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:27,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:27,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:27,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:28,210 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:28,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:28,224 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:28,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:28,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:28,225 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:28,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:28,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:28,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:28,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,262 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,288 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:28,288 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:29:28,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:28,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:28,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:28,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:28,428 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:28,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:28,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:28,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2022-12-06 07:29:28,428 INFO L420 AbstractCegarLoop]: === Iteration 430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 572734671, now seen corresponding path program 1 times [2022-12-06 07:29:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:28,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413367085] [2022-12-06 07:29:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:28,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:29:28,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:28,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413367085] [2022-12-06 07:29:28,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413367085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:28,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:28,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274381586] [2022-12-06 07:29:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:28,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:28,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:28,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:28,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:28,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:28,789 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:28,789 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:28,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:28,801 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:28,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:28,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:28,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:28,802 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:28,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:28,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:28,836 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:28,836 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:28,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:28,836 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:28,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:28,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,863 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:28,863 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:29:28,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:28,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:28,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:29,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:29:29,011 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:29,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2022-12-06 07:29:29,011 INFO L420 AbstractCegarLoop]: === Iteration 431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1979422290, now seen corresponding path program 1 times [2022-12-06 07:29:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598551735] [2022-12-06 07:29:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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:29:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598551735] [2022-12-06 07:29:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598551735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228618550] [2022-12-06 07:29:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:29,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:29,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,349 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:29,349 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:29,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:29,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:29,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:29,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:29,364 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:29,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:29,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,401 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:29,401 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:29,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:29,401 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:29,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:29,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,427 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:29,427 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:29:29,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:29,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:29,567 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:29,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:29,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:29,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:29,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:29,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2022-12-06 07:29:29,568 INFO L420 AbstractCegarLoop]: === Iteration 432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash -236611955, now seen corresponding path program 1 times [2022-12-06 07:29:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:29,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493481433] [2022-12-06 07:29:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:29,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:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:29,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493481433] [2022-12-06 07:29:29,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493481433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:29,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:29,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071182162] [2022-12-06 07:29:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:29,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:29,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:29,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:29,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:29,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:29,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:29,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:29,906 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:29,906 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:29:29,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13512 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:29,918 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:29,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:29,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:29,919 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:29,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:29,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:29,948 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:29,948 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 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 100 places, 92 transitions, 1195 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,974 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:29,974 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:29:29,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:29,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:29,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:30,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:29:30,131 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:30,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2022-12-06 07:29:30,131 INFO L420 AbstractCegarLoop]: === Iteration 433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1506198380, now seen corresponding path program 1 times [2022-12-06 07:29:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541548288] [2022-12-06 07:29:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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:29:30,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541548288] [2022-12-06 07:29:30,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541548288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996195177] [2022-12-06 07:29:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:30,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:30,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:30,464 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:30,464 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:30,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:30,479 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:30,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:30,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:30,479 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:30,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:30,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:30,520 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:30,520 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:30,520 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:30,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:30,520 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:30,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:30,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:30,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:30,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:30,546 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:30,546 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:29:30,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:30,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:30,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:30,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:30,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:29:30,681 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:30,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:30,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:30,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2022-12-06 07:29:30,681 INFO L420 AbstractCegarLoop]: === Iteration 434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1045958581, now seen corresponding path program 1 times [2022-12-06 07:29:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:30,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213302012] [2022-12-06 07:29:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:30,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:30,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:29:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:30,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213302012] [2022-12-06 07:29:30,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213302012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:30,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:30,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763245827] [2022-12-06 07:29:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:30,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:30,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:30,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:30,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:30,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:30,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,016 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:31,016 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:31,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13551 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:31,027 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:31,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:31,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:31,028 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:31,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:31,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,061 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:31,061 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:31,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,061 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,086 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:31,087 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:31,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:31,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:31,227 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:31,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2022-12-06 07:29:31,227 INFO L420 AbstractCegarLoop]: === Iteration 435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 696851754, now seen corresponding path program 1 times [2022-12-06 07:29:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234467171] [2022-12-06 07:29:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:31,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:29:31,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234467171] [2022-12-06 07:29:31,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234467171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146481695] [2022-12-06 07:29:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:31,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:31,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:31,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:31,556 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:31,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:31,569 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:31,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:31,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:31,570 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:31,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:31,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:31,605 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:31,606 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:31,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:31,606 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:31,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:31,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,632 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:31,632 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:29:31,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:31,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:31,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:31,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:31,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:29:31,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:31,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:31,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:31,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2022-12-06 07:29:31,776 INFO L420 AbstractCegarLoop]: === Iteration 436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1855305207, now seen corresponding path program 1 times [2022-12-06 07:29:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178587166] [2022-12-06 07:29:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:31,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:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:31,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178587166] [2022-12-06 07:29:31,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178587166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:31,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:31,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634821866] [2022-12-06 07:29:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:31,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:31,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:31,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:31,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:31,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,120 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:32,120 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:32,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:32,137 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:32,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:32,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:32,138 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:32,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:32,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,173 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:32,173 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:32,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,173 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,200 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:32,200 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:29:32,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3020 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:32,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:32,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:29:32,355 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:32,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2022-12-06 07:29:32,355 INFO L420 AbstractCegarLoop]: === Iteration 437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash -112494872, now seen corresponding path program 1 times [2022-12-06 07:29:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914234144] [2022-12-06 07:29:32,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:32,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914234144] [2022-12-06 07:29:32,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914234144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728172360] [2022-12-06 07:29:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:32,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:32,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:32,701 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:32,701 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:32,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:32,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:32,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:32,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:32,715 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:32,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:32,750 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:32,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:32,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:32,751 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:32,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:32,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,776 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:32,776 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:29:32,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:32,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:32,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:32,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:32,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:29:32,918 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:32,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:32,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:32,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2022-12-06 07:29:32,918 INFO L420 AbstractCegarLoop]: === Iteration 438 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1630315463, now seen corresponding path program 1 times [2022-12-06 07:29:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:32,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489244171] [2022-12-06 07:29:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:32,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:29:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:32,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489244171] [2022-12-06 07:29:32,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489244171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:32,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:32,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109689816] [2022-12-06 07:29:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:32,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:32,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:32,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:32,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:32,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:32,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,272 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:33,272 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:33,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:33,284 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:33,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:33,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:33,285 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:33,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:33,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,318 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:33,318 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:33,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,318 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,344 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:33,345 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:29:33,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:33,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:33,489 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:33,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:29:33,489 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:33,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:33,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2022-12-06 07:29:33,490 INFO L420 AbstractCegarLoop]: === Iteration 439 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash -921841498, now seen corresponding path program 1 times [2022-12-06 07:29:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:33,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155808667] [2022-12-06 07:29:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:33,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:29:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155808667] [2022-12-06 07:29:33,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155808667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:33,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:33,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:33,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320959301] [2022-12-06 07:29:33,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:33,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:33,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:33,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:33,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:33,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:33,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:33,830 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:33,830 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:33,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:33,844 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:33,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:33,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:33,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:33,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:33,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:33,885 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:33,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:33,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:33,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:33,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:33,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,910 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:33,911 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:33,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:33,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:33,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:34,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:29:34,068 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:34,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2022-12-06 07:29:34,068 INFO L420 AbstractCegarLoop]: === Iteration 440 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash 820968837, now seen corresponding path program 1 times [2022-12-06 07:29:34,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378573312] [2022-12-06 07:29:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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:29:34,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378573312] [2022-12-06 07:29:34,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378573312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80672452] [2022-12-06 07:29:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:34,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:34,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:34,410 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:34,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:34,422 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:34,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:34,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:34,423 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:34,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:34,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:34,457 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:34,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:34,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:34,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:34,457 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:34,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:34,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:34,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:34,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:34,482 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:34,483 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:34,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:34,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:34,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:34,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:34,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:29:34,644 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:34,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:34,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:34,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2022-12-06 07:29:34,645 INFO L420 AbstractCegarLoop]: === Iteration 441 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1731188124, now seen corresponding path program 1 times [2022-12-06 07:29:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:34,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626753476] [2022-12-06 07:29:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:34,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:29:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626753476] [2022-12-06 07:29:34,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626753476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:34,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:34,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610738043] [2022-12-06 07:29:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:34,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:34,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:34,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:34,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:34,998 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:34,998 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:35,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:35,013 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:35,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:35,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:35,014 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:35,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,051 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:35,051 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:35,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,051 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,077 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:35,077 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:29:35,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2955 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:35,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:35,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:29:35,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:35,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2022-12-06 07:29:35,217 INFO L420 AbstractCegarLoop]: === Iteration 442 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash 11622211, now seen corresponding path program 1 times [2022-12-06 07:29:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065323228] [2022-12-06 07:29:35,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065323228] [2022-12-06 07:29:35,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065323228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68689738] [2022-12-06 07:29:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:35,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:35,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:35,546 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:35,546 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:35,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:35,560 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:35,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:35,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:35,560 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:35,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:35,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:35,594 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:35,595 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:35,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:35,595 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:35,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:35,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,620 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:35,621 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 07:29:35,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:35,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:35,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:35,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:35,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:29:35,774 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:35,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:35,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:35,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2022-12-06 07:29:35,775 INFO L420 AbstractCegarLoop]: === Iteration 443 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1754432546, now seen corresponding path program 1 times [2022-12-06 07:29:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:35,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779396046] [2022-12-06 07:29:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:35,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:35,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779396046] [2022-12-06 07:29:35,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779396046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:35,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:35,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:35,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406365451] [2022-12-06 07:29:35,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:35,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:35,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:35,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:35,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:35,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,122 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:36,122 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:36,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:36,136 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:36,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:36,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:36,137 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:36,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:36,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,173 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:36,173 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:36,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,173 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,199 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:36,199 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:29:36,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:36,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:36,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:29:36,335 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:36,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2022-12-06 07:29:36,335 INFO L420 AbstractCegarLoop]: === Iteration 444 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash -797724415, now seen corresponding path program 1 times [2022-12-06 07:29:36,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892221928] [2022-12-06 07:29:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:36,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:36,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:36,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892221928] [2022-12-06 07:29:36,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892221928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:36,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:36,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:36,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349819438] [2022-12-06 07:29:36,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:36,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:36,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:36,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:36,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:36,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:36,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:36,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:36,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:36,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:36,695 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:36,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:36,710 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:36,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:36,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:36,711 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:36,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:36,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:36,747 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:36,747 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:36,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:36,747 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:36,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:36,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,772 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:36,772 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:36,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:36,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:36,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:36,938 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:36,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:29:36,939 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:36,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:36,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:36,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2022-12-06 07:29:36,939 INFO L420 AbstractCegarLoop]: === Iteration 445 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash 945085920, now seen corresponding path program 1 times [2022-12-06 07:29:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:36,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824350161] [2022-12-06 07:29:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,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:29:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824350161] [2022-12-06 07:29:37,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824350161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728179072] [2022-12-06 07:29:37,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:37,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:37,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,295 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:37,295 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:37,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:37,309 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:37,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:37,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:37,310 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:37,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:37,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,345 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:37,345 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:37,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,345 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,370 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:37,370 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:29:37,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:37,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:37,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:37,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:29:37,532 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:37,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:37,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:37,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2022-12-06 07:29:37,532 INFO L420 AbstractCegarLoop]: === Iteration 446 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1607071041, now seen corresponding path program 1 times [2022-12-06 07:29:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:37,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864109886] [2022-12-06 07:29:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:37,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:37,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:29:37,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:37,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864109886] [2022-12-06 07:29:37,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864109886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:37,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:37,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:37,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666012632] [2022-12-06 07:29:37,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:37,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:37,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:37,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:37,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:37,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:37,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:37,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:37,855 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:37,856 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:37,868 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:37,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:37,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:37,869 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:37,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:37,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:37,905 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:37,905 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:37,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:37,905 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,906 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:37,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:37,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,930 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:37,930 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:29:37,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:37,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:37,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:38,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:29:38,065 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:38,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2022-12-06 07:29:38,065 INFO L420 AbstractCegarLoop]: === Iteration 447 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:38,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash 135739294, now seen corresponding path program 1 times [2022-12-06 07:29:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812891899] [2022-12-06 07:29:38,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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:29:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812891899] [2022-12-06 07:29:38,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812891899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364015222] [2022-12-06 07:29:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:38,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:38,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,408 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:38,408 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:38,421 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:38,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:38,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:38,422 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:38,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:38,458 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:38,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:38,458 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:38,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:38,458 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:38,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:38,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:38,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:38,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:38,483 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:38,483 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:29:38,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:38,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:38,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:38,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:38,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:29:38,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:38,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:38,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:38,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2022-12-06 07:29:38,628 INFO L420 AbstractCegarLoop]: === Iteration 448 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:38,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1878549629, now seen corresponding path program 1 times [2022-12-06 07:29:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:38,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356019261] [2022-12-06 07:29:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:38,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:29:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:38,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356019261] [2022-12-06 07:29:38,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356019261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:38,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:38,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064514507] [2022-12-06 07:29:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:38,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:38,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:38,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:38,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:38,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:38,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:38,973 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:38,973 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:38,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:38,988 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:38,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:38,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:38,989 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:38,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:39,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:39,025 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:39,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:39,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:39,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:39,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:39,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,051 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:39,051 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:29:39,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:39,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:39,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:29:39,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:39,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2022-12-06 07:29:39,217 INFO L420 AbstractCegarLoop]: === Iteration 449 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash -673607332, now seen corresponding path program 1 times [2022-12-06 07:29:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311085696] [2022-12-06 07:29:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:39,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311085696] [2022-12-06 07:29:39,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311085696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:39,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:39,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321253129] [2022-12-06 07:29:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:39,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:39,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:39,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:39,573 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:39,574 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:39,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:39,587 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:39,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:39,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:39,588 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:39,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:39,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:39,625 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:39,625 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:39,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:39,625 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,626 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:39,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:39,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,651 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:39,651 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:39,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:39,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:39,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:39,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:39,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:29:39,801 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:39,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:39,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:39,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2022-12-06 07:29:39,802 INFO L420 AbstractCegarLoop]: === Iteration 450 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1069203003, now seen corresponding path program 1 times [2022-12-06 07:29:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:39,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911971906] [2022-12-06 07:29:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:39,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:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911971906] [2022-12-06 07:29:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911971906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:39,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:39,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527201494] [2022-12-06 07:29:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:39,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:39,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:39,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:39,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,130 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:40,130 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:29:40,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:40,144 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:40,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:40,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:40,145 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:40,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:40,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,180 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:40,180 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:40,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,180 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,206 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:40,206 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:29:40,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3015 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:40,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:40,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:29:40,357 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:40,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2022-12-06 07:29:40,358 INFO L420 AbstractCegarLoop]: === Iteration 451 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1482953958, now seen corresponding path program 1 times [2022-12-06 07:29:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150301890] [2022-12-06 07:29:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:40,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:29:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:40,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150301890] [2022-12-06 07:29:40,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150301890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:40,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:40,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968871351] [2022-12-06 07:29:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:40,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:40,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:40,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:40,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:40,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:40,712 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:40,712 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:29:40,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:40,726 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:40,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:40,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:40,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:40,727 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:40,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:40,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:40,763 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:40,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:40,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:40,764 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:40,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:40,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,789 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:40,789 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:29:40,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:40,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:40,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:40,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:40,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:29:40,938 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:40,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:40,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:40,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2022-12-06 07:29:40,938 INFO L420 AbstractCegarLoop]: === Iteration 452 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 259856377, now seen corresponding path program 1 times [2022-12-06 07:29:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:40,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889998467] [2022-12-06 07:29:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,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:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889998467] [2022-12-06 07:29:41,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889998467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518478081] [2022-12-06 07:29:41,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:41,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:41,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:41,291 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:41,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:41,305 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:41,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:41,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:41,306 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:41,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:41,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,342 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:41,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:41,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,369 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:41,369 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:29:41,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:41,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:41,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:41,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:29:41,513 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:41,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:41,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:41,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2022-12-06 07:29:41,513 INFO L420 AbstractCegarLoop]: === Iteration 453 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2002666712, now seen corresponding path program 1 times [2022-12-06 07:29:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:41,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462146832] [2022-12-06 07:29:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:41,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:41,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:41,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462146832] [2022-12-06 07:29:41,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462146832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:41,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:41,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30511505] [2022-12-06 07:29:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:41,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:41,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:41,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:41,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:41,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:41,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:41,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:41,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:41,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:41,844 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:41,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:41,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:41,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:41,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:41,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:41,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:41,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:41,896 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:41,896 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:41,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:41,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:41,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:41,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,922 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:41,922 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:29:41,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:41,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:41,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:42,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:29:42,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:42,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2022-12-06 07:29:42,075 INFO L420 AbstractCegarLoop]: === Iteration 454 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -549490249, now seen corresponding path program 1 times [2022-12-06 07:29:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758185472] [2022-12-06 07:29:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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:29:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758185472] [2022-12-06 07:29:42,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758185472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670209616] [2022-12-06 07:29:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:42,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,402 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:42,402 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:42,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:42,416 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:42,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:42,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:42,417 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:42,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:42,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:42,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:42,455 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:42,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:42,455 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:42,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:42,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:42,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:42,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:42,484 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:42,484 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:29:42,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:42,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:42,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:42,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:42,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:29:42,631 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:42,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:42,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2022-12-06 07:29:42,632 INFO L420 AbstractCegarLoop]: === Iteration 455 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1193320086, now seen corresponding path program 1 times [2022-12-06 07:29:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:42,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523081011] [2022-12-06 07:29:42,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:42,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:29:42,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:42,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523081011] [2022-12-06 07:29:42,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523081011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:42,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:42,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:42,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269889960] [2022-12-06 07:29:42,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:42,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:42,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:42,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:42,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:42,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:42,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:42,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:42,959 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:42,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:42,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:42,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:42,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:42,975 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:42,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:43,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,013 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,013 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:43,013 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:43,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,013 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,039 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:43,039 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:29:43,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2957 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:43,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:43,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:29:43,170 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:43,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2022-12-06 07:29:43,170 INFO L420 AbstractCegarLoop]: === Iteration 456 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1358836875, now seen corresponding path program 1 times [2022-12-06 07:29:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465421784] [2022-12-06 07:29:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465421784] [2022-12-06 07:29:43,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465421784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:43,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39918893] [2022-12-06 07:29:43,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:43,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:43,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:43,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:43,498 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:43,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13509 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:43,512 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:43,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:43,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:43,513 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:43,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:43,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:43,547 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:43,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:43,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:43,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:43,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:43,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,574 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:43,574 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:29:43,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:43,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:43,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:43,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:43,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:29:43,723 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:43,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:43,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:43,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2022-12-06 07:29:43,723 INFO L420 AbstractCegarLoop]: === Iteration 457 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 383973460, now seen corresponding path program 1 times [2022-12-06 07:29:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:43,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433831601] [2022-12-06 07:29:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:43,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:43,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:43,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433831601] [2022-12-06 07:29:43,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433831601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:43,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:43,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:43,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322294536] [2022-12-06 07:29:43,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:43,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:43,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:43,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:43,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:43,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:43,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:43,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:44,038 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:44,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:44,052 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:44,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:44,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:44,053 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:44,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:44,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,089 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:44,089 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:44,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,089 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,114 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:44,115 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:29:44,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:44,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:44,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:29:44,269 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:44,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2022-12-06 07:29:44,270 INFO L420 AbstractCegarLoop]: === Iteration 458 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2126783795, now seen corresponding path program 1 times [2022-12-06 07:29:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721834488] [2022-12-06 07:29:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,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:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721834488] [2022-12-06 07:29:44,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721834488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:44,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810300920] [2022-12-06 07:29:44,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:44,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:44,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:44,615 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:44,615 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:44,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:44,629 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:44,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:44,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:44,630 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:44,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:44,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:44,668 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:44,668 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:44,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:44,668 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:44,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:44,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,694 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:44,694 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:29:44,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:44,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:44,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:44,835 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:44,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:29:44,836 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:44,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:44,836 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:44,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2022-12-06 07:29:44,836 INFO L420 AbstractCegarLoop]: === Iteration 459 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash -425373166, now seen corresponding path program 1 times [2022-12-06 07:29:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159315226] [2022-12-06 07:29:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:44,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159315226] [2022-12-06 07:29:44,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159315226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:44,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:44,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550612612] [2022-12-06 07:29:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:44,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:44,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:44,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:44,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:44,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,182 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:45,182 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:45,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:45,197 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:45,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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 69 transitions. [2022-12-06 07:29:45,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:45,197 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:45,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:45,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,235 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:45,235 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:45,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,235 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,260 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:45,261 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:29:45,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:45,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:45,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:29:45,398 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:45,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2022-12-06 07:29:45,398 INFO L420 AbstractCegarLoop]: === Iteration 460 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1317437169, now seen corresponding path program 1 times [2022-12-06 07:29:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855353383] [2022-12-06 07:29:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855353383] [2022-12-06 07:29:45,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855353383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:45,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:45,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593875514] [2022-12-06 07:29:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:45,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:45,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:45,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:45,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:45,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:45,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:45,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:45,731 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:45,732 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:45,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:45,746 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:45,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:45,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:45,747 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:45,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:45,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:45,783 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:45,783 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:45,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:45,783 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:45,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:45,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,808 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:45,808 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:29:45,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:45,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:45,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:45,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:45,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:29:45,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:45,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:45,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:45,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2022-12-06 07:29:45,950 INFO L420 AbstractCegarLoop]: === Iteration 461 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1234719792, now seen corresponding path program 1 times [2022-12-06 07:29:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:45,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672993854] [2022-12-06 07:29:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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:29:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672993854] [2022-12-06 07:29:46,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672993854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843723531] [2022-12-06 07:29:46,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:46,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:46,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:46,280 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:46,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:46,295 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:46,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:46,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:46,296 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:46,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:46,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,335 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:46,335 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:46,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,335 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,361 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:46,361 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:29:46,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:46,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:46,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:46,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:29:46,514 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:46,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:46,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:46,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2022-12-06 07:29:46,514 INFO L420 AbstractCegarLoop]: === Iteration 462 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash 508090543, now seen corresponding path program 1 times [2022-12-06 07:29:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:46,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728324235] [2022-12-06 07:29:46,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:46,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:29:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:46,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728324235] [2022-12-06 07:29:46,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728324235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:46,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:46,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518425634] [2022-12-06 07:29:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:46,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:46,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:46,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:46,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:46,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:46,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:46,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:46,867 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:46,868 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:29:46,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:46,881 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:46,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:46,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:46,882 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:46,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:46,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:46,916 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:46,916 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:46,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:46,916 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,916 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:46,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:46,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,941 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:46,941 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:29:46,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:46,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:46,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:47,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:29:47,073 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:47,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2022-12-06 07:29:47,074 INFO L420 AbstractCegarLoop]: === Iteration 463 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2044066418, now seen corresponding path program 1 times [2022-12-06 07:29:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224578943] [2022-12-06 07:29:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:47,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:29:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224578943] [2022-12-06 07:29:47,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224578943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433569377] [2022-12-06 07:29:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:47,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:47,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,422 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:47,422 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:47,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:47,435 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:47,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:47,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:47,436 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:47,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:47,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:47,471 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:47,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:47,471 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:47,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:47,471 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:47,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:47,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:47,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:47,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:47,497 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:47,497 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:29:47,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:47,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:47,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:47,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:47,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:29:47,642 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:47,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:47,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:47,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2022-12-06 07:29:47,642 INFO L420 AbstractCegarLoop]: === Iteration 464 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -301256083, now seen corresponding path program 1 times [2022-12-06 07:29:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021103008] [2022-12-06 07:29:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29: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:29:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:47,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021103008] [2022-12-06 07:29:47,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021103008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:47,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:47,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549984551] [2022-12-06 07:29:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:47,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:47,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:47,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:47,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:47,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:47,971 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:47,971 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:29:47,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:47,985 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:47,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:47,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:47,986 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:47,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:48,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,023 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:48,023 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:48,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,023 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,049 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:48,049 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:48,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:48,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:48,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:29:48,192 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:48,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2022-12-06 07:29:48,192 INFO L420 AbstractCegarLoop]: === Iteration 465 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1441554252, now seen corresponding path program 1 times [2022-12-06 07:29:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788034075] [2022-12-06 07:29:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,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:29:48,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788034075] [2022-12-06 07:29:48,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788034075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583131696] [2022-12-06 07:29:48,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:48,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:48,540 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:48,540 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:48,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:48,553 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:48,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:48,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:48,554 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:48,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:48,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:48,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:48,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:48,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:48,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:48,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:48,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,616 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:48,616 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:29:48,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2957 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:48,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:48,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:48,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:48,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:29:48,762 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:48,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:48,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:48,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2022-12-06 07:29:48,762 INFO L420 AbstractCegarLoop]: === Iteration 466 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1110602709, now seen corresponding path program 1 times [2022-12-06 07:29:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:48,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905923302] [2022-12-06 07:29:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:48,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905923302] [2022-12-06 07:29:48,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905923302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:48,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:48,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393145507] [2022-12-06 07:29:48,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:48,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:48,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:48,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:48,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:48,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,088 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:49,088 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:49,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:49,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:49,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:49,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:49,102 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:49,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:49,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:49,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:49,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,137 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,162 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:49,162 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:29:49,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:49,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:49,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:29:49,309 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2022-12-06 07:29:49,309 INFO L420 AbstractCegarLoop]: === Iteration 467 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash 632207626, now seen corresponding path program 1 times [2022-12-06 07:29:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25678259] [2022-12-06 07:29:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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:29:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25678259] [2022-12-06 07:29:49,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25678259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451507471] [2022-12-06 07:29:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:49,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:49,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:49,652 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:49,652 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:49,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:49,665 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:49,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:49,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:49,667 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:49,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:49,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:49,704 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:49,704 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:49,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:49,704 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:49,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:49,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,729 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:49,730 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:29:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:49,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:49,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:49,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:49,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 07:29:49,910 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:49,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:49,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:49,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2022-12-06 07:29:49,910 INFO L420 AbstractCegarLoop]: === Iteration 468 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:49,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1919949335, now seen corresponding path program 1 times [2022-12-06 07:29:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:49,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653142595] [2022-12-06 07:29:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:49,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:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:49,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653142595] [2022-12-06 07:29:49,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653142595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:49,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:49,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830657496] [2022-12-06 07:29:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:49,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:49,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:49,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:49,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:49,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:49,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:50,261 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:50,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:50,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:50,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:50,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:50,276 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:50,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:50,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,313 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:50,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:50,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,313 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,339 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:50,339 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:29:50,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:50,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:50,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:50,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:29:50,476 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:50,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:50,477 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:50,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2022-12-06 07:29:50,477 INFO L420 AbstractCegarLoop]: === Iteration 469 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -177139000, now seen corresponding path program 1 times [2022-12-06 07:29:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608693085] [2022-12-06 07:29:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:50,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:29:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608693085] [2022-12-06 07:29:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608693085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:50,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:50,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036264622] [2022-12-06 07:29:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:50,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:50,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:50,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:50,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:50,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:50,821 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:50,822 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:29:50,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:50,836 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:50,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:50,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:50,837 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:50,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:50,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:50,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:50,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:50,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:50,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:50,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:50,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,894 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:50,894 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 07:29:50,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:50,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:50,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:51,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:29:51,057 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:51,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2022-12-06 07:29:51,057 INFO L420 AbstractCegarLoop]: === Iteration 470 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1565671335, now seen corresponding path program 1 times [2022-12-06 07:29:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082530977] [2022-12-06 07:29:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082530977] [2022-12-06 07:29:51,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082530977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793159541] [2022-12-06 07:29:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:51,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:51,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:51,437 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:51,437 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:51,452 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:51,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:51,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:51,453 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:51,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:51,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:51,489 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:51,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:51,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:51,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:51,490 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:51,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:51,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:51,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:51,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:51,516 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:51,516 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:29:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:51,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:51,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:51,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:51,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:29:51,668 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:51,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:51,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:51,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2022-12-06 07:29:51,668 INFO L420 AbstractCegarLoop]: === Iteration 471 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:51,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash -986485626, now seen corresponding path program 1 times [2022-12-06 07:29:51,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:51,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641039668] [2022-12-06 07:29:51,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:51,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:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:51,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641039668] [2022-12-06 07:29:51,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641039668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:51,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:51,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198593551] [2022-12-06 07:29:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:51,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:51,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:51,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:51,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:51,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,005 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:52,005 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:52,020 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:52,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:52,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:52,021 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:52,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,060 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:52,060 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:52,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,060 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,086 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:52,086 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:52,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:52,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:52,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:29:52,231 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:52,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2022-12-06 07:29:52,231 INFO L420 AbstractCegarLoop]: === Iteration 472 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 756324709, now seen corresponding path program 1 times [2022-12-06 07:29:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067068036] [2022-12-06 07:29:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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:29:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067068036] [2022-12-06 07:29:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067068036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560835232] [2022-12-06 07:29:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:52,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:52,579 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:52,580 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:52,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13551 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:52,594 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:52,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:52,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:52,595 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:52,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:52,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:52,633 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:52,633 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:52,633 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:52,633 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:52,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:52,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,660 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:52,660 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:29:52,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:52,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:52,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:52,811 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:52,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:29:52,812 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:52,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:52,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:52,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2022-12-06 07:29:52,812 INFO L420 AbstractCegarLoop]: === Iteration 473 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1795832252, now seen corresponding path program 1 times [2022-12-06 07:29:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:52,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059708256] [2022-12-06 07:29:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:52,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:29:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:52,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059708256] [2022-12-06 07:29:52,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059708256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:52,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:52,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557803647] [2022-12-06 07:29:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:52,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:52,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:52,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:52,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:52,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:52,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:52,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:52,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,159 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:53,160 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:53,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:53,178 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:53,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:53,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:53,179 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:53,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:53,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,222 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:53,222 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:53,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,222 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,223 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,248 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:53,248 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:29:53,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:53,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:53,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:29:53,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:53,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2022-12-06 07:29:53,411 INFO L420 AbstractCegarLoop]: === Iteration 474 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -53021917, now seen corresponding path program 1 times [2022-12-06 07:29:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515769379] [2022-12-06 07:29:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:53,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:29:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:53,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515769379] [2022-12-06 07:29:53,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515769379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:53,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:53,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263391861] [2022-12-06 07:29:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:53,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:53,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:53,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:53,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:53,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:53,749 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:53,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:53,763 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:53,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:53,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:53,764 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:53,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:53,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:53,799 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:53,799 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:53,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:53,800 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:53,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:53,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,825 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:53,825 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:29:53,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:53,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:53,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:53,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:53,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:29:53,962 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:53,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:53,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:53,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2022-12-06 07:29:53,963 INFO L420 AbstractCegarLoop]: === Iteration 475 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1689788418, now seen corresponding path program 1 times [2022-12-06 07:29:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:53,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078471407] [2022-12-06 07:29:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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:29:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078471407] [2022-12-06 07:29:54,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078471407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030129294] [2022-12-06 07:29:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:54,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:54,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,304 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:54,304 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:54,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:54,319 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:54,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:54,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:54,319 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:54,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:54,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:54,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:54,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,381 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:54,381 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:29:54,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:54,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:54,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:54,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:29:54,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:54,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:54,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:54,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2022-12-06 07:29:54,517 INFO L420 AbstractCegarLoop]: === Iteration 476 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -862368543, now seen corresponding path program 1 times [2022-12-06 07:29:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530118179] [2022-12-06 07:29:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:54,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:29:54,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:54,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530118179] [2022-12-06 07:29:54,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530118179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:54,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:54,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95288751] [2022-12-06 07:29:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:54,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:54,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:54,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:54,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:54,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:54,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:54,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:54,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:54,886 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:54,887 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:54,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:54,900 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:54,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:54,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:54,901 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:54,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:54,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:54,937 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:54,938 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:54,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:54,938 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:54,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:54,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,963 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:54,963 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:29:54,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:54,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:54,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:55,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:29:55,112 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:55,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2022-12-06 07:29:55,112 INFO L420 AbstractCegarLoop]: === Iteration 477 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 880441792, now seen corresponding path program 1 times [2022-12-06 07:29:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683274819] [2022-12-06 07:29:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683274819] [2022-12-06 07:29:55,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683274819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914433137] [2022-12-06 07:29:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:55,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:55,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:55,471 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:55,471 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:29:55,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:55,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:55,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:55,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:55,487 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:55,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:55,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:55,524 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:55,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:55,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:55,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:55,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:55,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:55,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:55,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:55,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:55,553 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:55,553 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:29:55,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:55,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:55,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:55,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:55,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:29:55,710 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:55,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:55,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:55,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2022-12-06 07:29:55,710 INFO L420 AbstractCegarLoop]: === Iteration 478 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1671715169, now seen corresponding path program 1 times [2022-12-06 07:29:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:55,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206092703] [2022-12-06 07:29:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:55,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:29:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206092703] [2022-12-06 07:29:55,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206092703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:55,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:55,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90533999] [2022-12-06 07:29:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:55,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:55,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:55,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:55,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:55,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:55,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:56,056 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:56,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:56,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:56,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:56,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:56,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:56,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,107 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:56,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:56,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,133 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:56,133 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:29:56,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:56,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:56,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:29:56,286 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2022-12-06 07:29:56,287 INFO L420 AbstractCegarLoop]: === Iteration 479 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 71095166, now seen corresponding path program 1 times [2022-12-06 07:29:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329014785] [2022-12-06 07:29:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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:29:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329014785] [2022-12-06 07:29:56,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329014785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877506717] [2022-12-06 07:29:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:56,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:56,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:56,629 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:56,630 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:29:56,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:56,643 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:56,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:56,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:56,643 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:56,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:56,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:56,679 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:56,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:56,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:56,679 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:56,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:56,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:56,704 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:29:56,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:56,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:56,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:56,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:56,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:29:56,852 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:56,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:56,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:56,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2022-12-06 07:29:56,852 INFO L420 AbstractCegarLoop]: === Iteration 480 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1813905501, now seen corresponding path program 1 times [2022-12-06 07:29:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:56,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95100235] [2022-12-06 07:29:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:56,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:29:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:56,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95100235] [2022-12-06 07:29:56,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95100235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:56,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:56,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281146551] [2022-12-06 07:29:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:56,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:56,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:56,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:56,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:56,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:56,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:56,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:56,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,179 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:57,180 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:29:57,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13509 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:57,192 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:57,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:57,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:57,193 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:57,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:57,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,227 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:57,227 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:57,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,227 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,252 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:57,252 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:29:57,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:57,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:57,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:57,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:29:57,406 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:57,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:57,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:57,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2022-12-06 07:29:57,407 INFO L420 AbstractCegarLoop]: === Iteration 481 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash -738251460, now seen corresponding path program 1 times [2022-12-06 07:29:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:57,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155112255] [2022-12-06 07:29:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:57,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:57,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:57,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155112255] [2022-12-06 07:29:57,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155112255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:57,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:57,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669637491] [2022-12-06 07:29:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:57,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:57,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:57,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:57,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:57,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:57,766 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:57,767 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:29:57,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:57,781 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:57,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:57,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:57,782 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:57,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:57,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:57,819 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,819 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:57,819 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:57,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:57,819 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:57,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:57,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,868 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:57,868 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:29:57,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:57,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:57,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:58,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:29:58,009 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:58,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2022-12-06 07:29:58,009 INFO L420 AbstractCegarLoop]: === Iteration 482 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1004558875, now seen corresponding path program 1 times [2022-12-06 07:29:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301968018] [2022-12-06 07:29:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301968018] [2022-12-06 07:29:58,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301968018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615608765] [2022-12-06 07:29:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:58,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:58,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,369 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:58,369 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:29:58,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:58,383 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:58,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:58,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:58,384 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:58,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:58,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:58,420 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:58,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:58,421 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:58,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:58,421 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:58,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:58,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:58,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:58,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:58,447 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:58,447 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:29:58,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:58,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:58,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:58,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:58,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:29:58,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:58,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:58,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:58,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2022-12-06 07:29:58,607 INFO L420 AbstractCegarLoop]: === Iteration 483 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1547598086, now seen corresponding path program 1 times [2022-12-06 07:29:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:58,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232563182] [2022-12-06 07:29:58,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:58,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:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:58,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232563182] [2022-12-06 07:29:58,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232563182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:58,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:58,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805448440] [2022-12-06 07:29:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:58,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:58,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:58,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:58,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:58,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:58,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:58,951 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:58,951 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:29:58,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:58,967 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:58,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:58,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:58,968 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:58,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:59,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:59,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:59,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,040 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:29:59,041 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:29:59,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:29:59,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:59,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:29:59,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2022-12-06 07:29:59,190 INFO L420 AbstractCegarLoop]: === Iteration 484 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 195212249, now seen corresponding path program 1 times [2022-12-06 07:29:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988516236] [2022-12-06 07:29:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988516236] [2022-12-06 07:29:59,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988516236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977954790] [2022-12-06 07:29:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:59,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:59,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:59,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:29:59,525 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:29:59,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13560 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:29:59,537 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:29:59,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:29:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:29:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:29:59,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:29:59,538 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:29:59,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:29:59,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:59,573 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:29:59,574 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:29:59,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:29:59,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:29:59,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:59,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,599 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:29:59,599 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:29:59,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:29:59,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:29:59,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:29:59,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:29:59,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:29:59,748 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:29:59,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:29:59,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:29:59,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2022-12-06 07:29:59,748 INFO L420 AbstractCegarLoop]: === Iteration 485 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:29:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:29:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1938022584, now seen corresponding path program 1 times [2022-12-06 07:29:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:29:59,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045259683] [2022-12-06 07:29:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:29:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:29:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:29:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:29:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045259683] [2022-12-06 07:29:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045259683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:29:59,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:29:59,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:29:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40993160] [2022-12-06 07:29:59,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:29:59,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:29:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:29:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:29:59,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:29:59,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:59,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:29:59,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,101 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:00,101 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:00,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:00,115 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:00,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:00,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:00,116 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:00,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:00,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,153 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:00,153 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:00,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,153 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,184 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:00,185 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:30:00,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2963 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:00,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:00,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:30:00,328 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:00,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2022-12-06 07:30:00,328 INFO L420 AbstractCegarLoop]: === Iteration 486 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -614134377, now seen corresponding path program 1 times [2022-12-06 07:30:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434592007] [2022-12-06 07:30:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434592007] [2022-12-06 07:30:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434592007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880724391] [2022-12-06 07:30:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:00,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:00,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:00,709 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:00,710 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:00,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:00,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:00,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:00,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:00,725 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:00,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:00,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:00,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:00,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:00,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:00,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:00,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:00,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,788 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:00,788 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:00,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:00,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:00,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:00,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:00,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:00,933 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:00,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:00,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:00,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2022-12-06 07:30:00,933 INFO L420 AbstractCegarLoop]: === Iteration 487 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1128675958, now seen corresponding path program 1 times [2022-12-06 07:30:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:00,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638825074] [2022-12-06 07:30:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:00,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:30:00,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:00,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638825074] [2022-12-06 07:30:00,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638825074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:00,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:00,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:00,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586361951] [2022-12-06 07:30:00,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:00,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:00,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:00,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:00,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:00,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,271 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:01,271 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:01,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:01,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:01,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:01,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:01,286 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:01,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:01,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,326 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:01,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:01,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,357 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:01,357 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:01,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:01,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:01,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:01,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:30:01,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:01,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:01,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:01,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2022-12-06 07:30:01,510 INFO L420 AbstractCegarLoop]: === Iteration 488 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1423481003, now seen corresponding path program 1 times [2022-12-06 07:30:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:01,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296010891] [2022-12-06 07:30:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:01,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:30:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:01,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296010891] [2022-12-06 07:30:01,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296010891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:01,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:01,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294968554] [2022-12-06 07:30:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:01,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:01,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:01,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:01,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:01,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:01,841 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:01,841 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:01,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:01,856 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:01,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:01,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:01,857 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:01,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:01,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:01,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:01,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:01,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:01,894 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:01,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:01,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:01,921 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:30:01,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:01,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:01,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:02,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:30:02,073 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:02,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2022-12-06 07:30:02,074 INFO L420 AbstractCegarLoop]: === Iteration 489 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash 319329332, now seen corresponding path program 1 times [2022-12-06 07:30:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317753756] [2022-12-06 07:30:02,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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:30:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317753756] [2022-12-06 07:30:02,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317753756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508516415] [2022-12-06 07:30:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:02,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:02,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:02,440 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:02,441 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:02,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:02,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:02,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:02,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:02,455 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:02,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:02,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:02,495 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:02,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:02,518 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:02,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:02,518 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:02,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:02,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:02,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:02,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:02,547 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:02,547 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:02,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:02,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:02,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:02,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:02,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:30:02,711 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:02,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:02,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2022-12-06 07:30:02,712 INFO L420 AbstractCegarLoop]: === Iteration 490 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2062139667, now seen corresponding path program 1 times [2022-12-06 07:30:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979028632] [2022-12-06 07:30:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:02,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:30:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:02,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979028632] [2022-12-06 07:30:02,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979028632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:02,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:02,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143698589] [2022-12-06 07:30:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:02,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:02,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:02,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:02,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:02,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,035 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:03,035 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:03,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:03,049 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:03,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:03,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:03,049 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:03,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,093 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:03,093 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:03,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,093 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,125 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:03,125 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:03,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:03,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:03,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:30:03,268 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:03,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2022-12-06 07:30:03,268 INFO L420 AbstractCegarLoop]: === Iteration 491 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash -490017294, now seen corresponding path program 1 times [2022-12-06 07:30:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829511376] [2022-12-06 07:30:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829511376] [2022-12-06 07:30:03,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829511376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120485138] [2022-12-06 07:30:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:03,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:03,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:03,620 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:03,620 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:03,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:03,633 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:03,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:03,633 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:03,633 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:03,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:03,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:03,666 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:03,666 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:03,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:03,666 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:03,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:03,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,694 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:03,694 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:30:03,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:03,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:03,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:03,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:03,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:30:03,838 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:03,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:03,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:03,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2022-12-06 07:30:03,839 INFO L420 AbstractCegarLoop]: === Iteration 492 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:03,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1252793041, now seen corresponding path program 1 times [2022-12-06 07:30:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:03,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127967250] [2022-12-06 07:30:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:03,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:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127967250] [2022-12-06 07:30:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127967250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658976230] [2022-12-06 07:30:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:03,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:03,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:03,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:03,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:03,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,192 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:04,192 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:04,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:04,207 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:04,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:04,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:04,208 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:04,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:04,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,246 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:04,246 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:04,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,247 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,272 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:04,273 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:04,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:04,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:04,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:04,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:30:04,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:04,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:04,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:04,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2022-12-06 07:30:04,411 INFO L420 AbstractCegarLoop]: === Iteration 493 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1299363920, now seen corresponding path program 1 times [2022-12-06 07:30:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579326330] [2022-12-06 07:30:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:04,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:04,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:04,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579326330] [2022-12-06 07:30:04,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579326330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:04,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:04,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068528487] [2022-12-06 07:30:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:04,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:04,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:04,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:04,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:04,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:04,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:04,768 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:04,768 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:04,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:04,780 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:04,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:04,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:04,781 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:04,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:04,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:04,814 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:04,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:04,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:04,814 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:04,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:04,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,840 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:04,840 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:30:04,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:04,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:04,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:05,003 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:30:05,003 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:05,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2022-12-06 07:30:05,004 INFO L420 AbstractCegarLoop]: === Iteration 494 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 443446415, now seen corresponding path program 1 times [2022-12-06 07:30:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182973382] [2022-12-06 07:30:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:05,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:30:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:05,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182973382] [2022-12-06 07:30:05,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182973382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000774922] [2022-12-06 07:30:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:05,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:05,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:05,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:05,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,344 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:05,344 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:05,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:05,358 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:05,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:05,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:05,359 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:05,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:05,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,395 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:05,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:05,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,396 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,423 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:05,424 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:05,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:05,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:05,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:05,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:30:05,560 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:05,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:05,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:05,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2022-12-06 07:30:05,560 INFO L420 AbstractCegarLoop]: === Iteration 495 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2108710546, now seen corresponding path program 1 times [2022-12-06 07:30:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:05,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545527837] [2022-12-06 07:30:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:05,572 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 [1545527837] [2022-12-06 07:30:05,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545527837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:05,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:05,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834038985] [2022-12-06 07:30:05,629 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=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:05,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:05,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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: 1 of 43 [2022-12-06 07:30:05,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:05,939 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:05,940 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:05,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:05,953 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:05,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:05,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:05,954 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:05,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:05,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:05,988 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:05,988 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:05,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:05,988 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:05,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:05,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:05,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,014 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:06,014 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:30:06,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:06,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:06,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:30:06,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:06,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2022-12-06 07:30:06,152 INFO L420 AbstractCegarLoop]: === Iteration 496 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash -365900211, now seen corresponding path program 1 times [2022-12-06 07:30:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190500881] [2022-12-06 07:30:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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:30:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190500881] [2022-12-06 07:30:06,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190500881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:06,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108862189] [2022-12-06 07:30:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:06,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:06,535 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:06,536 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:06,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:06,556 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:06,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:06,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:06,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:06,557 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:06,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:06,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:06,605 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:06,606 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:06,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:06,606 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:06,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:06,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,633 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:06,633 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:06,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:06,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:06,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:06,802 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:06,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 07:30:06,802 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:06,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:06,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:06,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2022-12-06 07:30:06,803 INFO L420 AbstractCegarLoop]: === Iteration 497 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1376910124, now seen corresponding path program 1 times [2022-12-06 07:30:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:06,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154831359] [2022-12-06 07:30:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:06,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:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154831359] [2022-12-06 07:30:06,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154831359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:06,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:06,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114689110] [2022-12-06 07:30:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:06,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:06,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:06,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:06,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:06,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,220 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:07,220 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:07,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:07,234 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:07,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:07,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:07,234 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:07,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:07,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,268 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:07,268 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:07,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,268 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,293 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:07,293 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:30:07,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:07,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:07,454 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:07,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:30:07,454 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:07,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:07,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:07,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2022-12-06 07:30:07,455 INFO L420 AbstractCegarLoop]: === Iteration 498 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1175246837, now seen corresponding path program 1 times [2022-12-06 07:30:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:07,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674624916] [2022-12-06 07:30:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:07,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:30:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:07,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674624916] [2022-12-06 07:30:07,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674624916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:07,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:07,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622028250] [2022-12-06 07:30:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:07,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:07,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:07,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:07,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:07,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:07,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:07,827 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:30:07,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:07,840 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:07,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:07,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:07,841 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:07,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:07,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:07,877 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:07,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:07,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:07,877 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:07,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:07,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,902 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:07,902 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:30:07,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:07,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:07,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:08,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:30:08,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:08,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2022-12-06 07:30:08,054 INFO L420 AbstractCegarLoop]: === Iteration 499 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash 567563498, now seen corresponding path program 1 times [2022-12-06 07:30:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326546329] [2022-12-06 07:30:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,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:30:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326546329] [2022-12-06 07:30:08,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326546329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234080647] [2022-12-06 07:30:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:08,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:08,410 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:08,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:08,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:08,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:08,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:08,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:08,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:08,459 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:08,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:08,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:08,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:08,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:08,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:08,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:08,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:08,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:08,484 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:08,484 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:08,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:08,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:08,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:08,645 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:08,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:30:08,645 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:08,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:08,646 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:08,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2022-12-06 07:30:08,646 INFO L420 AbstractCegarLoop]: === Iteration 500 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1984593463, now seen corresponding path program 1 times [2022-12-06 07:30:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:08,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644680122] [2022-12-06 07:30:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644680122] [2022-12-06 07:30:08,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644680122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:08,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:08,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665395956] [2022-12-06 07:30:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:08,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:08,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:08,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:08,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:08,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:08,969 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:08,969 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:08,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:08,984 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:08,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:08,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:08,984 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:08,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:09,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,023 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:09,023 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:09,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,023 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,048 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:09,048 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:09,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:09,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:09,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:30:09,199 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:09,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2022-12-06 07:30:09,199 INFO L420 AbstractCegarLoop]: === Iteration 501 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash -241783128, now seen corresponding path program 1 times [2022-12-06 07:30:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982807516] [2022-12-06 07:30:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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:30:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982807516] [2022-12-06 07:30:09,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982807516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509070506] [2022-12-06 07:30:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:09,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:09,559 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:09,560 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:09,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:09,573 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:09,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:09,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:09,574 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:09,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:09,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:09,610 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:09,610 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:09,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:09,610 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:09,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:09,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,636 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:09,636 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:30:09,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:09,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:09,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:09,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:09,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:30:09,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:09,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:09,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:09,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2022-12-06 07:30:09,791 INFO L420 AbstractCegarLoop]: === Iteration 502 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1501027207, now seen corresponding path program 1 times [2022-12-06 07:30:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:09,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951446885] [2022-12-06 07:30:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:09,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:30:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:09,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951446885] [2022-12-06 07:30:09,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951446885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:09,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:09,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307814930] [2022-12-06 07:30:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:09,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:09,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:09,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:09,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:09,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,143 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:10,143 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:10,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:10,157 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:10,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:10,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:10,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:10,158 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:10,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,198 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:10,198 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:10,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,198 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,223 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:10,224 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:10,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:10,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:10,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:30:10,372 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:10,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2022-12-06 07:30:10,372 INFO L420 AbstractCegarLoop]: === Iteration 503 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1051129754, now seen corresponding path program 1 times [2022-12-06 07:30:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293872734] [2022-12-06 07:30:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293872734] [2022-12-06 07:30:10,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293872734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927786188] [2022-12-06 07:30:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:10,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:10,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:10,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:10,719 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:10,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:10,733 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:10,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:10,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:10,734 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:10,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:10,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:10,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:10,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:10,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:10,771 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:10,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:10,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,796 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:10,796 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:10,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:10,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:10,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:10,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:10,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:10,942 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:10,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:10,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:10,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2022-12-06 07:30:10,942 INFO L420 AbstractCegarLoop]: === Iteration 504 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash 691680581, now seen corresponding path program 1 times [2022-12-06 07:30:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:10,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946915648] [2022-12-06 07:30:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:10,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:30:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:10,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946915648] [2022-12-06 07:30:10,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946915648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:10,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:10,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573770477] [2022-12-06 07:30:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:10,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:10,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:10,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:10,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,262 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:11,262 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:11,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:11,275 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:11,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:11,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:11,276 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:11,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:11,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,310 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:11,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:11,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,335 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:11,336 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:11,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:11,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:11,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:11,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:30:11,472 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:11,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:11,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:11,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2022-12-06 07:30:11,473 INFO L420 AbstractCegarLoop]: === Iteration 505 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1860476380, now seen corresponding path program 1 times [2022-12-06 07:30:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370961377] [2022-12-06 07:30:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:11,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:30:11,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:11,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370961377] [2022-12-06 07:30:11,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370961377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:11,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:11,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361500881] [2022-12-06 07:30:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:11,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:11,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:11,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:11,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:11,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:11,805 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:11,805 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:11,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:11,818 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:11,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:11,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:11,819 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:11,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:11,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:11,855 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:11,855 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:11,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:11,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:11,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:11,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,881 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:11,881 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:30:11,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:11,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:11,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:12,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:30:12,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:12,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2022-12-06 07:30:12,028 INFO L420 AbstractCegarLoop]: === Iteration 506 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -117666045, now seen corresponding path program 1 times [2022-12-06 07:30:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250100564] [2022-12-06 07:30:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:12,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250100564] [2022-12-06 07:30:12,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250100564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420918053] [2022-12-06 07:30:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:12,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:12,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,376 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:12,377 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:12,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:12,392 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:12,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:12,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:12,393 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:12,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:12,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,431 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:12,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:12,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,458 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:12,458 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:30:12,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:12,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:12,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:12,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:12,603 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:12,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2022-12-06 07:30:12,603 INFO L420 AbstractCegarLoop]: === Iteration 507 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1625144290, now seen corresponding path program 1 times [2022-12-06 07:30:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:12,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397850342] [2022-12-06 07:30:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:12,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:30:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:12,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397850342] [2022-12-06 07:30:12,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397850342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:12,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:12,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931322422] [2022-12-06 07:30:12,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:12,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:12,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:12,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:12,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:12,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:12,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:12,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:12,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:12,946 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:12,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:12,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:12,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:12,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:12,961 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:12,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:12,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:12,997 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:12,998 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:12,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:12,998 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:12,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:12,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:12,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,023 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:13,023 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:13,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:13,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:13,168 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2022-12-06 07:30:13,169 INFO L420 AbstractCegarLoop]: === Iteration 508 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash -927012671, now seen corresponding path program 1 times [2022-12-06 07:30:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231776763] [2022-12-06 07:30:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231776763] [2022-12-06 07:30:13,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231776763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439081378] [2022-12-06 07:30:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:13,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:13,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:13,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:13,525 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13503 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:13,539 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:13,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:13,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:13,540 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:13,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:13,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:13,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:13,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:13,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:13,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:13,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:13,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,604 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:13,604 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:13,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:13,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:13,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:13,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:13,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:30:13,760 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:13,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:13,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:13,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2022-12-06 07:30:13,760 INFO L420 AbstractCegarLoop]: === Iteration 509 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 815797664, now seen corresponding path program 1 times [2022-12-06 07:30:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3793684] [2022-12-06 07:30:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:13,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:30:13,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:13,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3793684] [2022-12-06 07:30:13,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3793684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:13,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:13,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751581910] [2022-12-06 07:30:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:13,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:13,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:13,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:13,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:13,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,113 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:14,113 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:14,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13507 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:14,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:14,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:14,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:14,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:14,129 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:14,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:14,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:14,165 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:14,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,165 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,190 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:14,190 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:30:14,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:14,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:14,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:30:14,347 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:14,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2022-12-06 07:30:14,347 INFO L420 AbstractCegarLoop]: === Iteration 510 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:14,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1736359297, now seen corresponding path program 1 times [2022-12-06 07:30:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393361733] [2022-12-06 07:30:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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:30:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393361733] [2022-12-06 07:30:14,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393361733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598434213] [2022-12-06 07:30:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:14,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:14,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:14,673 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:14,673 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:14,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:14,686 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:14,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:14,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:14,687 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:14,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:14,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:14,724 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:14,725 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:14,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:14,725 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:14,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:14,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,750 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:14,750 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:30:14,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:14,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:14,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:14,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:14,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:30:14,898 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:14,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:14,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:14,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2022-12-06 07:30:14,898 INFO L420 AbstractCegarLoop]: === Iteration 511 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash 6451038, now seen corresponding path program 1 times [2022-12-06 07:30:14,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:14,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456983418] [2022-12-06 07:30:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:14,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:30:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:14,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456983418] [2022-12-06 07:30:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456983418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496205709] [2022-12-06 07:30:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:14,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:14,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:14,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:14,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:14,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:15,241 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:15,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:15,255 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:15,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:15,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:15,256 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:15,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:15,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,291 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:15,291 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:15,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,291 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,317 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:15,317 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:15,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:15,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:15,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:15,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:30:15,472 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:15,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:15,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:15,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2022-12-06 07:30:15,472 INFO L420 AbstractCegarLoop]: === Iteration 512 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1749261373, now seen corresponding path program 1 times [2022-12-06 07:30:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:15,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115753178] [2022-12-06 07:30:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:15,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:15,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:30:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115753178] [2022-12-06 07:30:15,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115753178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:15,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:15,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100431919] [2022-12-06 07:30:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:15,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:15,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:15,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:15,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:15,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:15,810 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:15,810 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:15,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:15,825 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:15,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:15,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:15,826 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:15,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:15,860 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:15,860 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:15,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:15,861 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:15,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:15,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,886 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:15,887 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:15,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:15,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:15,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:16,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:30:16,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:16,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2022-12-06 07:30:16,039 INFO L420 AbstractCegarLoop]: === Iteration 513 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -802895588, now seen corresponding path program 1 times [2022-12-06 07:30:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992551763] [2022-12-06 07:30:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:16,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:30:16,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992551763] [2022-12-06 07:30:16,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992551763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49856660] [2022-12-06 07:30:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:16,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:16,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:16,410 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:16,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:16,425 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:16,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:16,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:16,426 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:16,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:16,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:16,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:16,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:16,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:16,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:16,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:16,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:16,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:16,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:16,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:16,491 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:16,491 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:30:16,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:16,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:16,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:16,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:16,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:30:16,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:16,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:16,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:16,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2022-12-06 07:30:16,627 INFO L420 AbstractCegarLoop]: === Iteration 514 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash 939914747, now seen corresponding path program 1 times [2022-12-06 07:30:16,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:16,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693869710] [2022-12-06 07:30:16,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:16,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:30:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:16,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693869710] [2022-12-06 07:30:16,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693869710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:16,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:16,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110056138] [2022-12-06 07:30:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:16,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:16,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:16,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:16,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:16,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:16,974 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:16,974 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:16,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13580 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:16,988 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:16,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:16,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:16,988 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:16,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:17,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,026 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:17,027 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:17,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,027 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,052 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:17,052 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:30:17,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:17,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:17,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:30:17,213 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:17,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2022-12-06 07:30:17,213 INFO L420 AbstractCegarLoop]: === Iteration 515 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1612242214, now seen corresponding path program 1 times [2022-12-06 07:30:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125557359] [2022-12-06 07:30:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:17,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:30:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125557359] [2022-12-06 07:30:17,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125557359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402712919] [2022-12-06 07:30:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:17,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:17,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:17,546 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:17,546 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:17,560 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:17,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:17,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:17,561 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:17,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:17,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:17,597 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:17,597 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:17,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:17,597 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:17,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:17,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,622 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:17,623 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:17,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:17,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:17,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:17,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:17,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:30:17,763 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:17,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:17,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:17,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2022-12-06 07:30:17,763 INFO L420 AbstractCegarLoop]: === Iteration 516 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:17,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 130568121, now seen corresponding path program 1 times [2022-12-06 07:30:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:17,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426910979] [2022-12-06 07:30:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:17,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426910979] [2022-12-06 07:30:17,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426910979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:17,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:17,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93079395] [2022-12-06 07:30:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:17,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:17,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:17,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:17,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:17,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,081 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:18,081 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:18,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:18,096 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:18,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:18,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:18,097 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:18,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:18,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,136 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:18,136 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:18,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,136 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,162 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:18,162 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:30:18,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:18,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:18,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:30:18,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:18,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2022-12-06 07:30:18,309 INFO L420 AbstractCegarLoop]: === Iteration 517 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1873378456, now seen corresponding path program 1 times [2022-12-06 07:30:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093910747] [2022-12-06 07:30:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:18,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:18,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093910747] [2022-12-06 07:30:18,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093910747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355275252] [2022-12-06 07:30:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:18,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:18,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:18,654 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:18,654 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:18,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:18,669 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:18,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:18,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:18,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:18,670 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:18,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:18,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:18,708 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:18,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:18,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:18,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:18,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:18,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,733 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:18,733 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 07:30:18,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:18,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:18,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:18,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:18,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:30:18,868 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:18,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:18,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2022-12-06 07:30:18,868 INFO L420 AbstractCegarLoop]: === Iteration 518 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -678778505, now seen corresponding path program 1 times [2022-12-06 07:30:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:18,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828396348] [2022-12-06 07:30:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:18,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:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:18,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828396348] [2022-12-06 07:30:18,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828396348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:18,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:18,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179513601] [2022-12-06 07:30:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:18,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:18,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:18,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:18,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,216 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:19,217 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:30:19,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:19,231 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:19,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:19,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:19,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:19,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:19,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,267 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:19,267 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:19,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,267 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,293 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:19,293 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:30:19,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:19,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:19,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:19,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:30:19,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:19,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:19,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:19,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2022-12-06 07:30:19,435 INFO L420 AbstractCegarLoop]: === Iteration 519 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1064031830, now seen corresponding path program 1 times [2022-12-06 07:30:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143399713] [2022-12-06 07:30:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:19,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:30:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:19,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143399713] [2022-12-06 07:30:19,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143399713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:19,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:19,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602881138] [2022-12-06 07:30:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:19,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:19,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:19,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:19,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:19,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:19,771 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:19,772 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:19,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:19,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:19,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:19,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:19,786 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:19,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:19,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:19,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:19,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:19,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:19,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:19,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:19,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,848 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:19,849 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:30:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:19,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:19,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:20,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:30:20,008 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:20,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2022-12-06 07:30:20,008 INFO L420 AbstractCegarLoop]: === Iteration 520 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1488125131, now seen corresponding path program 1 times [2022-12-06 07:30:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426333710] [2022-12-06 07:30:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,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:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426333710] [2022-12-06 07:30:20,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426333710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167790362] [2022-12-06 07:30:20,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:20,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:20,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,329 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:20,330 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:20,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13564 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:20,344 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:20,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:20,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:20,344 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:20,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:20,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:20,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,405 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:20,405 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:20,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2955 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:20,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:20,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:20,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:20,550 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:20,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:20,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:20,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2022-12-06 07:30:20,550 INFO L420 AbstractCegarLoop]: === Iteration 521 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash 254685204, now seen corresponding path program 1 times [2022-12-06 07:30:20,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:20,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674476226] [2022-12-06 07:30:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:20,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:20,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674476226] [2022-12-06 07:30:20,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674476226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:20,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:20,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262290870] [2022-12-06 07:30:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:20,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:20,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:20,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:20,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:20,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:20,872 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:20,872 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:20,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:20,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:20,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:20,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:20,886 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:20,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:20,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:20,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:20,925 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:20,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:20,926 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:20,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:20,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,953 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:20,954 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 07:30:20,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:20,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:20,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:21,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:30:21,087 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2022-12-06 07:30:21,087 INFO L420 AbstractCegarLoop]: === Iteration 522 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1997495539, now seen corresponding path program 1 times [2022-12-06 07:30:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560191659] [2022-12-06 07:30:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,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:30:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560191659] [2022-12-06 07:30:21,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560191659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503097120] [2022-12-06 07:30:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:21,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:21,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:21,443 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:21,443 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:21,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:21,458 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:21,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:21,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:21,459 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:21,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:21,497 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:21,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:21,497 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:21,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:21,497 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:21,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:21,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:21,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:21,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:21,523 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:21,523 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:21,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:21,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:21,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:21,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:21,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:30:21,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:21,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:21,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2022-12-06 07:30:21,667 INFO L420 AbstractCegarLoop]: === Iteration 523 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash -554661422, now seen corresponding path program 1 times [2022-12-06 07:30:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:21,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342640819] [2022-12-06 07:30:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:21,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:30:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:21,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342640819] [2022-12-06 07:30:21,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342640819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:21,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:21,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898192970] [2022-12-06 07:30:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:21,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:21,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:21,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:21,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:21,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:21,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:21,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,067 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:22,068 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:22,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:22,082 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:22,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:22,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:22,083 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:22,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:22,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:22,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:22,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,145 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:22,145 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:30:22,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:22,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:22,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:30:22,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:22,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2022-12-06 07:30:22,292 INFO L420 AbstractCegarLoop]: === Iteration 524 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:22,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1188148913, now seen corresponding path program 1 times [2022-12-06 07:30:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399562283] [2022-12-06 07:30:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399562283] [2022-12-06 07:30:22,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399562283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823927043] [2022-12-06 07:30:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:22,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:22,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:22,654 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:22,654 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:22,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:22,672 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:22,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:22,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:22,673 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:22,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:22,721 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:22,721 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:22,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:22,721 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:22,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:22,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,749 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:22,749 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:22,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:22,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:22,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:22,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:22,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:30:22,905 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:22,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:22,905 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:22,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2022-12-06 07:30:22,906 INFO L420 AbstractCegarLoop]: === Iteration 525 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1364008048, now seen corresponding path program 1 times [2022-12-06 07:30:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202428465] [2022-12-06 07:30:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:22,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:22,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:22,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202428465] [2022-12-06 07:30:22,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202428465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:22,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:22,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524362468] [2022-12-06 07:30:22,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:22,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:22,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:22,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:22,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:22,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,252 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:23,252 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:23,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:23,267 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:23,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:23,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:23,268 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:23,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:23,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,309 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:23,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:23,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,310 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,336 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:23,336 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:23,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:23,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:23,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:23,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:30:23,492 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:23,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:23,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:23,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2022-12-06 07:30:23,492 INFO L420 AbstractCegarLoop]: === Iteration 526 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 378802287, now seen corresponding path program 1 times [2022-12-06 07:30:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663996543] [2022-12-06 07:30:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:23,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:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:23,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663996543] [2022-12-06 07:30:23,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663996543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:23,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:23,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030666385] [2022-12-06 07:30:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:23,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:23,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:23,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:23,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:23,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:23,831 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:23,831 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:23,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:23,846 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:23,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:23,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:23,847 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:23,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:23,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:23,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:23,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:23,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:23,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:23,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:23,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,910 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:23,910 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 07:30:23,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:23,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:23,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:24,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:30:24,047 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:24,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2022-12-06 07:30:24,048 INFO L420 AbstractCegarLoop]: === Iteration 527 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2121612622, now seen corresponding path program 1 times [2022-12-06 07:30:24,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737741045] [2022-12-06 07:30:24,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:24,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737741045] [2022-12-06 07:30:24,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737741045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178719864] [2022-12-06 07:30:24,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:24,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:24,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:24,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:24,423 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:24,439 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:24,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:24,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:24,440 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:24,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:24,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:24,475 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:24,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:24,475 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:24,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:24,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:24,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:24,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:24,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:24,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:24,501 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:24,501 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:30:24,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:24,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:24,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:24,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:24,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:30:24,648 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:24,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:24,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2022-12-06 07:30:24,648 INFO L420 AbstractCegarLoop]: === Iteration 528 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash -430544339, now seen corresponding path program 1 times [2022-12-06 07:30:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:24,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783579008] [2022-12-06 07:30:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:24,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:30:24,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:24,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783579008] [2022-12-06 07:30:24,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783579008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:24,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:24,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:24,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340325835] [2022-12-06 07:30:24,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:24,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:24,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:24,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:24,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:24,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:24,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:24,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,002 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:25,002 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:25,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:25,017 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:25,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:25,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:25,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:25,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:25,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,055 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:25,055 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:25,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,055 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,081 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:25,081 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:25,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:25,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:25,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:30:25,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:25,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2022-12-06 07:30:25,229 INFO L420 AbstractCegarLoop]: === Iteration 529 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1312265996, now seen corresponding path program 1 times [2022-12-06 07:30:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2964310] [2022-12-06 07:30:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2964310] [2022-12-06 07:30:25,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2964310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:25,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369799724] [2022-12-06 07:30:25,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:25,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:25,577 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:25,578 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:25,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:25,593 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:25,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:25,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:25,594 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:25,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:25,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:25,637 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:25,637 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:25,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:25,637 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:25,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:25,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,666 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:25,666 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:25,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:25,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:25,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:25,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:25,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:30:25,820 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:25,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:25,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:25,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2022-12-06 07:30:25,820 INFO L420 AbstractCegarLoop]: === Iteration 530 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1239890965, now seen corresponding path program 1 times [2022-12-06 07:30:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:25,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568470598] [2022-12-06 07:30:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:25,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:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:25,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568470598] [2022-12-06 07:30:25,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568470598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:25,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:25,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836537210] [2022-12-06 07:30:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:25,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:25,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:25,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:25,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:25,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:25,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,156 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:26,156 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:26,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:26,170 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:26,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:26,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:26,171 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:26,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:26,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,209 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:26,209 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:26,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,209 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,235 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:26,235 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:30:26,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:26,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:26,375 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:30:26,376 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:26,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2022-12-06 07:30:26,376 INFO L420 AbstractCegarLoop]: === Iteration 531 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 502919370, now seen corresponding path program 1 times [2022-12-06 07:30:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663570551] [2022-12-06 07:30:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:26,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:30:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:26,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663570551] [2022-12-06 07:30:26,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663570551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:26,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:26,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145729301] [2022-12-06 07:30:26,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:26,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:26,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:26,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:26,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:26,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:26,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:26,727 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:26,727 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:26,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:26,741 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:26,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:26,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:26,742 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:26,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:26,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:26,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:26,780 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:26,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:26,780 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:26,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:26,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,806 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:26,806 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:26,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:26,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:26,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:26,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:26,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:26,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:26,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:26,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:26,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2022-12-06 07:30:26,950 INFO L420 AbstractCegarLoop]: === Iteration 532 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2049237591, now seen corresponding path program 1 times [2022-12-06 07:30:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:26,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118576200] [2022-12-06 07:30:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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:30:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118576200] [2022-12-06 07:30:27,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118576200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716868902] [2022-12-06 07:30:27,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:27,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,283 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:27,283 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:27,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:27,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:27,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:27,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:27,298 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:27,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:27,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,337 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:27,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:27,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,364 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:27,364 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:27,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:27,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:27,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:27,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:30:27,514 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:27,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:27,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2022-12-06 07:30:27,514 INFO L420 AbstractCegarLoop]: === Iteration 533 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -306427256, now seen corresponding path program 1 times [2022-12-06 07:30:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:27,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064693299] [2022-12-06 07:30:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:27,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:27,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:30:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:27,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064693299] [2022-12-06 07:30:27,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064693299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:27,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:27,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258380094] [2022-12-06 07:30:27,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:27,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:27,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:27,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:27,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:27,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:27,861 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:27,861 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:27,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:27,876 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:27,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:27,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:27,876 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:27,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:27,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:27,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:27,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:27,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:27,914 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:27,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:27,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,940 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:27,940 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:27,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:27,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:27,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:28,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:30:28,084 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:28,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2022-12-06 07:30:28,084 INFO L420 AbstractCegarLoop]: === Iteration 534 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1436383079, now seen corresponding path program 1 times [2022-12-06 07:30:28,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718583385] [2022-12-06 07:30:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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:30:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718583385] [2022-12-06 07:30:28,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718583385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:28,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959835702] [2022-12-06 07:30:28,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:28,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:28,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,428 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:28,428 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:28,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:28,441 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:28,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:28,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:28,442 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:28,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:28,478 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:28,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:28,478 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:28,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:28,478 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:28,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:28,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:28,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:28,503 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:28,503 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:30:28,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:28,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:28,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:28,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:28,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:30:28,638 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:28,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:28,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2022-12-06 07:30:28,638 INFO L420 AbstractCegarLoop]: === Iteration 535 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1115773882, now seen corresponding path program 1 times [2022-12-06 07:30:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:28,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922469236] [2022-12-06 07:30:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:28,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:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922469236] [2022-12-06 07:30:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922469236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:28,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:28,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129118912] [2022-12-06 07:30:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:28,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:28,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:28,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:28,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:28,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:28,990 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:28,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:29,003 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:29,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:29,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:29,004 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:29,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:29,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,038 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:29,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:29,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,063 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:29,064 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:30:29,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:29,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:29,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:30:29,213 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:29,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2022-12-06 07:30:29,213 INFO L420 AbstractCegarLoop]: === Iteration 536 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash 627036453, now seen corresponding path program 1 times [2022-12-06 07:30:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068925900] [2022-12-06 07:30:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068925900] [2022-12-06 07:30:29,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068925900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362792759] [2022-12-06 07:30:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:29,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:29,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:29,559 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:29,559 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:29,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:29,573 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:29,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:29,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:29,574 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:29,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:29,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:29,610 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:29,610 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:29,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:29,610 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:29,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:29,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,635 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:29,636 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:29,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:29,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:29,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:29,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:29,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:30:29,797 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:29,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:29,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:29,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2022-12-06 07:30:29,797 INFO L420 AbstractCegarLoop]: === Iteration 537 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1925120508, now seen corresponding path program 1 times [2022-12-06 07:30:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:29,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614273923] [2022-12-06 07:30:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:29,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:30:29,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:29,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614273923] [2022-12-06 07:30:29,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614273923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:29,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:29,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936952822] [2022-12-06 07:30:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:29,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:29,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:29,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:29,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:29,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,142 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:30,143 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:30,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:30,157 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:30,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:30,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:30,157 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:30,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:30,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,195 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:30,196 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:30,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,196 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,221 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:30,221 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:30,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:30,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:30:30,364 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:30,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2022-12-06 07:30:30,364 INFO L420 AbstractCegarLoop]: === Iteration 538 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash -182310173, now seen corresponding path program 1 times [2022-12-06 07:30:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517724147] [2022-12-06 07:30:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:30,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:30:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517724147] [2022-12-06 07:30:30,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517724147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:30,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232228735] [2022-12-06 07:30:30,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:30,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:30,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:30,709 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:30,710 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:30,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:30,723 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:30,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:30,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:30,724 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:30,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:30,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:30,760 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:30,760 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:30,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:30,761 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:30,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:30,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,793 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:30,793 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:30,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:30,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:30,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:30,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:30:30,937 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:30,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:30,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2022-12-06 07:30:30,937 INFO L420 AbstractCegarLoop]: === Iteration 539 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1560500162, now seen corresponding path program 1 times [2022-12-06 07:30:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:30,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320036030] [2022-12-06 07:30:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:30,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:30:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:30,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320036030] [2022-12-06 07:30:30,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320036030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:30,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:30,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774350668] [2022-12-06 07:30:30,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:30,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:30,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:30,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:30,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:30,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,263 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:31,263 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:31,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13580 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:31,277 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:31,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:31,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:31,292 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:31,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:31,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,330 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:31,331 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:31,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,331 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,357 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:31,357 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:31,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:31,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:31,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:31,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:31,501 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:31,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:31,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2022-12-06 07:30:31,501 INFO L420 AbstractCegarLoop]: === Iteration 540 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -991656799, now seen corresponding path program 1 times [2022-12-06 07:30:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:31,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696982316] [2022-12-06 07:30:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:31,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:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:31,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696982316] [2022-12-06 07:30:31,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696982316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:31,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:31,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994497821] [2022-12-06 07:30:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:31,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:31,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:31,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:31,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:31,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:31,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:31,844 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:31,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:31,858 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:31,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:31,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:31,859 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:31,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:31,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:31,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:31,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:31,894 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:31,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:31,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,925 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:31,926 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:31,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:31,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:31,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:32,057 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:30:32,058 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:32,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2022-12-06 07:30:32,058 INFO L420 AbstractCegarLoop]: === Iteration 541 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 751153536, now seen corresponding path program 1 times [2022-12-06 07:30:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725325194] [2022-12-06 07:30:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:32,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:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725325194] [2022-12-06 07:30:32,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725325194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509738758] [2022-12-06 07:30:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:32,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:32,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,367 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:32,368 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:32,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:32,380 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:32,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:32,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:32,380 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:32,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:32,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,414 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:32,414 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:32,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,414 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,439 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:32,439 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:32,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:32,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:32,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:32,581 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:30:32,581 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:32,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,581 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:32,581 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:32,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2022-12-06 07:30:32,581 INFO L420 AbstractCegarLoop]: === Iteration 542 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:32,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1801003425, now seen corresponding path program 1 times [2022-12-06 07:30:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:32,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532844232] [2022-12-06 07:30:32,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:32,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:32,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532844232] [2022-12-06 07:30:32,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532844232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:32,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:32,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:32,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554440977] [2022-12-06 07:30:32,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:32,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:32,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:32,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:32,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:32,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:32,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:32,917 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:32,917 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:32,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:32,931 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:32,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:32,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:32,932 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:32,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:32,969 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:32,969 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:32,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:32,969 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:32,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:32,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:32,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,001 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:33,001 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:30:33,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:33,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:33,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:30:33,148 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2022-12-06 07:30:33,148 INFO L420 AbstractCegarLoop]: === Iteration 543 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -58193090, now seen corresponding path program 1 times [2022-12-06 07:30:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284259715] [2022-12-06 07:30:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:33,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:30:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284259715] [2022-12-06 07:30:33,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284259715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631868104] [2022-12-06 07:30:33,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:33,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:33,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:33,480 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:33,480 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:33,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:33,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:33,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:33,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:33,496 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:33,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:33,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:33,534 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:33,534 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:33,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:33,534 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:33,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:33,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,559 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:33,560 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:33,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:33,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:33,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:33,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:33,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:30:33,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:33,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:33,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:33,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2022-12-06 07:30:33,702 INFO L420 AbstractCegarLoop]: === Iteration 544 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1684617245, now seen corresponding path program 1 times [2022-12-06 07:30:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:33,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294020211] [2022-12-06 07:30:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:33,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:30:33,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:33,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294020211] [2022-12-06 07:30:33,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294020211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:33,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:33,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:33,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189713906] [2022-12-06 07:30:33,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:33,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:33,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:33,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:33,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:34,056 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:34,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:34,071 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:34,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:34,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:34,072 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:34,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:34,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,109 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:34,110 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:34,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,110 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,140 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:34,141 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:34,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:34,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:34,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:34,281 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:34,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2022-12-06 07:30:34,282 INFO L420 AbstractCegarLoop]: === Iteration 545 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -867539716, now seen corresponding path program 1 times [2022-12-06 07:30:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025450858] [2022-12-06 07:30:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025450858] [2022-12-06 07:30:34,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025450858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576267949] [2022-12-06 07:30:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:34,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:34,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:34,629 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:34,629 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:34,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:34,642 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:34,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:34,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:34,643 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:34,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:34,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:34,679 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:34,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:34,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:34,679 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:34,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:34,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:34,704 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:30:34,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:34,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:34,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:34,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:34,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:30:34,842 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:34,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:34,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2022-12-06 07:30:34,842 INFO L420 AbstractCegarLoop]: === Iteration 546 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 875270619, now seen corresponding path program 1 times [2022-12-06 07:30:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:34,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437493234] [2022-12-06 07:30:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:34,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:30:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:34,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437493234] [2022-12-06 07:30:34,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437493234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:34,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:34,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705604101] [2022-12-06 07:30:34,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:34,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:34,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:34,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:34,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:34,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:34,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:34,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,188 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:35,188 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:35,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:35,202 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:35,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:35,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:35,203 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:35,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:35,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:35,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,283 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:35,283 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:35,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:35,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:35,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:35,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:30:35,423 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:35,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:35,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:35,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2022-12-06 07:30:35,423 INFO L420 AbstractCegarLoop]: === Iteration 547 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1676886342, now seen corresponding path program 1 times [2022-12-06 07:30:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:35,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947997722] [2022-12-06 07:30:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:35,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947997722] [2022-12-06 07:30:35,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947997722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:35,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:35,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258426104] [2022-12-06 07:30:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:35,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:35,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:35,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:35,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:35,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:35,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:35,765 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:35,766 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:35,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:35,779 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:35,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:35,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:35,780 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:35,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:35,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:35,822 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:35,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:35,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:35,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:35,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:35,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,855 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:35,855 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:30:35,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:35,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:35,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:36,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:36,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:30:36,012 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:36,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:36,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2022-12-06 07:30:36,013 INFO L420 AbstractCegarLoop]: === Iteration 548 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 65923993, now seen corresponding path program 1 times [2022-12-06 07:30:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:36,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035607658] [2022-12-06 07:30:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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:30:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035607658] [2022-12-06 07:30:36,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035607658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:36,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749543116] [2022-12-06 07:30:36,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:36,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:36,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:36,427 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:36,427 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:36,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:36,439 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:36,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:36,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:36,440 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:36,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:36,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:36,472 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:36,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:36,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:36,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:36,472 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:36,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:36,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:36,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:36,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:36,500 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:36,500 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:30:36,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:36,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:36,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:36,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:36,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:30:36,662 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:36,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:36,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2022-12-06 07:30:36,663 INFO L420 AbstractCegarLoop]: === Iteration 549 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1808734328, now seen corresponding path program 1 times [2022-12-06 07:30:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:36,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289715168] [2022-12-06 07:30:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:36,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:36,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:30:36,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289715168] [2022-12-06 07:30:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289715168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:36,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:36,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214324457] [2022-12-06 07:30:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:36,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:36,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:36,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:36,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:36,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,025 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:37,025 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:37,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:37,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:37,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:37,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:37,045 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:37,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:37,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:37,081 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:37,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,081 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,106 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:37,107 INFO L131 PetriNetUnfolder]: For 3328/3540 co-relation queries the response was YES. [2022-12-06 07:30:37,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3328/3540 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:37,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:37,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:37,252 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:37,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2022-12-06 07:30:37,252 INFO L420 AbstractCegarLoop]: === Iteration 550 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,252 INFO L85 PathProgramCache]: Analyzing trace with hash -743422633, now seen corresponding path program 1 times [2022-12-06 07:30:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923851511] [2022-12-06 07:30:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,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:30:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923851511] [2022-12-06 07:30:37,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923851511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488986451] [2022-12-06 07:30:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:37,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:37,634 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:37,634 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:37,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13549 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:37,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:37,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:37,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:37,647 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:37,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:37,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:37,677 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:37,677 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:37,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:37,677 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:37,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:37,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,703 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:37,703 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:37,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:37,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:37,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:37,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:37,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:30:37,852 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:37,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:37,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:37,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2022-12-06 07:30:37,853 INFO L420 AbstractCegarLoop]: === Iteration 551 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash 999387702, now seen corresponding path program 1 times [2022-12-06 07:30:37,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:37,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800442564] [2022-12-06 07:30:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:37,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:37,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:30:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:37,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800442564] [2022-12-06 07:30:37,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800442564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:37,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:37,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751685101] [2022-12-06 07:30:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:37,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:37,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:37,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:37,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:37,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,199 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:38,200 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:38,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:38,213 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:38,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:38,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:38,214 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:38,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,251 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:38,251 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:38,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,251 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,276 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:38,276 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:38,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:38,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:38,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:30:38,427 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:38,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2022-12-06 07:30:38,428 INFO L420 AbstractCegarLoop]: === Iteration 552 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1552769259, now seen corresponding path program 1 times [2022-12-06 07:30:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621000115] [2022-12-06 07:30:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621000115] [2022-12-06 07:30:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621000115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:38,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506177590] [2022-12-06 07:30:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:38,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:38,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:38,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:38,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:38,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:38,768 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:38,768 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:38,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13584 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:38,780 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:38,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:38,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:38,781 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:38,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:38,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:38,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:38,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:38,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:38,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:38,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:38,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,838 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:38,838 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:38,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:38,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:38,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:38,982 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:38,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:30:38,982 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:38,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:38,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2022-12-06 07:30:38,983 INFO L420 AbstractCegarLoop]: === Iteration 553 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 190041076, now seen corresponding path program 1 times [2022-12-06 07:30:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:38,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448904652] [2022-12-06 07:30:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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:30:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448904652] [2022-12-06 07:30:39,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448904652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:39,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126321954] [2022-12-06 07:30:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:39,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:39,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,333 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:39,333 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:39,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:39,346 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:39,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:39,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:39,347 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:39,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:39,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,383 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:39,383 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:39,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,383 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,408 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:39,408 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:39,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:39,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:39,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:39,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:30:39,551 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:39,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:39,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:39,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2022-12-06 07:30:39,551 INFO L420 AbstractCegarLoop]: === Iteration 554 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1932851411, now seen corresponding path program 1 times [2022-12-06 07:30:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224420651] [2022-12-06 07:30:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:39,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:39,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224420651] [2022-12-06 07:30:39,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224420651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:39,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273343399] [2022-12-06 07:30:39,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:39,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:39,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:39,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:39,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:39,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:39,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:39,883 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:39,883 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:39,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:39,895 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:39,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:39,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:39,896 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:39,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:39,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:39,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:39,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:39,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:39,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:39,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:39,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:39,953 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:39,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:39,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:39,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:40,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:40,098 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:40,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2022-12-06 07:30:40,098 INFO L420 AbstractCegarLoop]: === Iteration 555 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -619305550, now seen corresponding path program 1 times [2022-12-06 07:30:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71575146] [2022-12-06 07:30:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71575146] [2022-12-06 07:30:40,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71575146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568304422] [2022-12-06 07:30:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:40,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:40,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,407 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:40,407 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:40,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:40,420 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:40,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:40,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:40,421 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:40,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:40,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:40,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:40,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:40,453 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:40,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:40,453 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:40,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:40,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:40,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:40,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:40,478 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:40,478 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:40,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:40,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:40,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:40,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:30:40,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:40,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,628 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:40,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:40,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2022-12-06 07:30:40,628 INFO L420 AbstractCegarLoop]: === Iteration 556 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1123504785, now seen corresponding path program 1 times [2022-12-06 07:30:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993367799] [2022-12-06 07:30:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:40,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:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:40,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993367799] [2022-12-06 07:30:40,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993367799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:40,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:40,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459470402] [2022-12-06 07:30:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:40,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:40,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:40,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:40,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:40,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:40,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:40,959 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:30:40,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:40,972 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:40,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:40,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:40,973 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:40,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:41,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:41,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:41,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,009 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,034 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:41,034 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:41,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:41,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:41,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:41,178 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:41,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2022-12-06 07:30:41,178 INFO L420 AbstractCegarLoop]: === Iteration 557 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1428652176, 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 [1849281804] [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,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,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:30:41,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849281804] [2022-12-06 07:30:41,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849281804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771166048] [2022-12-06 07:30:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:41,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:41,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:41,514 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:41,514 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:41,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13554 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:41,529 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:41,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:41,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:41,529 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:41,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:41,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:41,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:41,568 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:41,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:41,568 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:41,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:41,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,593 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:41,593 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:30:41,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:41,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:41,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:41,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:41,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:30:41,735 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:41,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:41,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:41,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2022-12-06 07:30:41,736 INFO L420 AbstractCegarLoop]: === Iteration 558 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 314158159, now seen corresponding path program 1 times [2022-12-06 07:30:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:41,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645359040] [2022-12-06 07:30:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:41,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:30:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:41,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645359040] [2022-12-06 07:30:41,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645359040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:41,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:41,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526469741] [2022-12-06 07:30:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:41,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:41,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:41,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:41,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:41,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:41,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,073 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:42,074 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:42,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:42,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:42,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:42,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:42,088 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:42,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:42,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:42,124 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:42,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,124 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,149 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:42,149 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:42,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2963 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:42,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:42,284 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:30:42,285 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:42,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2022-12-06 07:30:42,285 INFO L420 AbstractCegarLoop]: === Iteration 559 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2056968494, now seen corresponding path program 1 times [2022-12-06 07:30:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438375018] [2022-12-06 07:30:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:42,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:30:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438375018] [2022-12-06 07:30:42,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438375018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673833865] [2022-12-06 07:30:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:42,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:42,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:42,627 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:42,627 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:42,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:42,641 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:42,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:42,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:42,642 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:42,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:42,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:42,678 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:42,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:42,678 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:42,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:42,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,703 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:42,704 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:42,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:42,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:42,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:42,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:42,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:30:42,847 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:42,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:42,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:42,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2022-12-06 07:30:42,847 INFO L420 AbstractCegarLoop]: === Iteration 560 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -495188467, now seen corresponding path program 1 times [2022-12-06 07:30:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:42,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058558224] [2022-12-06 07:30:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:42,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:30:42,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:42,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058558224] [2022-12-06 07:30:42,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058558224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:42,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:42,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543636379] [2022-12-06 07:30:42,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:42,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:42,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:42,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:42,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:42,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:42,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:42,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,190 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:43,190 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:43,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:43,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:43,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:43,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:43,206 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:43,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:43,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,239 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:43,240 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:43,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,240 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,265 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:43,265 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:43,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:43,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:30:43,406 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:43,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2022-12-06 07:30:43,406 INFO L420 AbstractCegarLoop]: === Iteration 561 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1247621868, now seen corresponding path program 1 times [2022-12-06 07:30:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838845866] [2022-12-06 07:30:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:43,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:30:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:43,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838845866] [2022-12-06 07:30:43,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838845866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:43,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:43,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877706856] [2022-12-06 07:30:43,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:43,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:43,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:43,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:43,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:43,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:43,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:43,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:43,737 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:43,737 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:43,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:43,750 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:43,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:43,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:43,751 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:43,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:43,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:43,783 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:43,783 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:43,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:43,783 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:43,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:43,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,809 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:43,809 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:30:43,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:43,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:43,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:43,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:43,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:30:43,945 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:43,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:43,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:43,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2022-12-06 07:30:43,945 INFO L420 AbstractCegarLoop]: === Iteration 562 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1304535093, now seen corresponding path program 1 times [2022-12-06 07:30:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644362675] [2022-12-06 07:30:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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:30:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644362675] [2022-12-06 07:30:44,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644362675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993609151] [2022-12-06 07:30:44,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:44,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:44,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:44,291 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:44,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:44,306 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:44,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:44,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:44,307 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:44,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:44,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:44,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:44,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,369 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:44,369 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:30:44,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:44,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:44,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:44,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:30:44,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:44,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:44,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:44,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2022-12-06 07:30:44,531 INFO L420 AbstractCegarLoop]: === Iteration 563 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash 438275242, now seen corresponding path program 1 times [2022-12-06 07:30:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:44,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929502236] [2022-12-06 07:30:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:44,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:30:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929502236] [2022-12-06 07:30:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929502236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:44,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248225990] [2022-12-06 07:30:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:44,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:44,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:44,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:44,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:44,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:44,885 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:44,885 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:44,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:44,901 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:44,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:44,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:44,902 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:44,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:44,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:44,939 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:44,939 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:44,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:44,940 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:44,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:44,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,966 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:44,966 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:30:44,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:44,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:44,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:45,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:30:45,114 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:45,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2022-12-06 07:30:45,114 INFO L420 AbstractCegarLoop]: === Iteration 564 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2113881719, now seen corresponding path program 1 times [2022-12-06 07:30:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675991614] [2022-12-06 07:30:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,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:30:45,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675991614] [2022-12-06 07:30:45,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675991614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680118198] [2022-12-06 07:30:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,173 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:45,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:45,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:45,451 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:45,451 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:45,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:45,465 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:45,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:45,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:45,465 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:45,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:45,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:45,501 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:45,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:45,501 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:45,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:45,501 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:45,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:45,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:45,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:45,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:45,527 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:45,528 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:45,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:45,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:45,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:45,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:45,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:30:45,677 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:45,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:45,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:45,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2022-12-06 07:30:45,677 INFO L420 AbstractCegarLoop]: === Iteration 565 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:45,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash -371071384, now seen corresponding path program 1 times [2022-12-06 07:30:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:45,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810911119] [2022-12-06 07:30:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:45,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:30:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:45,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810911119] [2022-12-06 07:30:45,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810911119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:45,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:45,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536108732] [2022-12-06 07:30:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:45,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:45,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:45,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:45,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:45,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:45,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,009 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:46,009 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:46,024 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:46,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:46,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:46,025 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:46,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:46,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,063 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:46,063 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:46,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,063 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,089 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:46,089 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:30:46,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:46,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:46,225 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:30:46,226 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:46,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2022-12-06 07:30:46,226 INFO L420 AbstractCegarLoop]: === Iteration 566 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1371738951, now seen corresponding path program 1 times [2022-12-06 07:30:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144117906] [2022-12-06 07:30:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:46,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:30:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144117906] [2022-12-06 07:30:46,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144117906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972223437] [2022-12-06 07:30:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:46,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:46,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:46,567 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:46,567 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:46,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:46,582 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:46,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:46,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:46,583 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:46,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:46,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:46,619 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,619 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:46,620 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:46,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:46,620 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:46,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:46,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,645 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:46,645 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:30:46,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:46,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:46,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:46,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:46,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:30:46,810 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:46,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:46,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:46,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2022-12-06 07:30:46,810 INFO L420 AbstractCegarLoop]: === Iteration 567 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1180418010, now seen corresponding path program 1 times [2022-12-06 07:30:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:46,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336885319] [2022-12-06 07:30:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:46,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:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336885319] [2022-12-06 07:30:46,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336885319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:46,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:46,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48458753] [2022-12-06 07:30:46,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:46,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:46,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:46,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:46,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:46,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,160 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:47,160 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:47,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:47,176 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:47,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:47,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:47,177 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:47,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:47,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,214 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:47,214 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:47,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,214 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,240 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:47,240 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:30:47,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:47,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:47,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:47,385 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:47,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2022-12-06 07:30:47,385 INFO L420 AbstractCegarLoop]: === Iteration 568 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 562392325, now seen corresponding path program 1 times [2022-12-06 07:30:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893867296] [2022-12-06 07:30:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:47,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:30:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893867296] [2022-12-06 07:30:47,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893867296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:47,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:47,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105703548] [2022-12-06 07:30:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:47,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:47,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:47,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:47,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:47,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:47,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:47,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:47,731 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:47,732 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:47,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:47,747 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:47,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:47,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:47,748 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:47,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:47,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:47,786 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:47,786 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:47,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:47,786 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:47,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:47,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,812 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:47,812 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:47,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:47,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:47,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:47,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:47,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:47,957 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:47,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:47,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:47,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2022-12-06 07:30:47,957 INFO L420 AbstractCegarLoop]: === Iteration 569 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:47,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1989764636, now seen corresponding path program 1 times [2022-12-06 07:30:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:47,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145061842] [2022-12-06 07:30:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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:30:48,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145061842] [2022-12-06 07:30:48,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145061842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564747653] [2022-12-06 07:30:48,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:48,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,315 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:48,315 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:48,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:48,334 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:48,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:48,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:48,335 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:48,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:48,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,376 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:48,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:48,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,376 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,403 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:48,404 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:30:48,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:48,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:48,548 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:48,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:30:48,548 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:48,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:48,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:48,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2022-12-06 07:30:48,548 INFO L420 AbstractCegarLoop]: === Iteration 570 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:48,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -246954301, now seen corresponding path program 1 times [2022-12-06 07:30:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:48,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377817929] [2022-12-06 07:30:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:48,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:30:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:48,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377817929] [2022-12-06 07:30:48,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377817929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:48,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:48,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475926865] [2022-12-06 07:30:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:48,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:48,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:48,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:48,880 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:48,880 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:48,895 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:48,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:48,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:48,896 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:48,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:48,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:48,933 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:48,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:48,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:48,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:48,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:48,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,960 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:48,960 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:30:48,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:48,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:48,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:49,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:30:49,112 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:49,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2022-12-06 07:30:49,112 INFO L420 AbstractCegarLoop]: === Iteration 571 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1495856034, now seen corresponding path program 1 times [2022-12-06 07:30:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779654539] [2022-12-06 07:30:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779654539] [2022-12-06 07:30:49,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779654539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812406557] [2022-12-06 07:30:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:49,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:49,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:49,448 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:49,449 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:49,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:49,463 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:49,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:49,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:49,464 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:49,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:49,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:49,503 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:49,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:49,503 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:49,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:49,503 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:49,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:49,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:49,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:49,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:49,529 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:49,529 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:49,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:49,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:49,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:49,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:49,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:49,674 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:49,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:49,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:49,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2022-12-06 07:30:49,674 INFO L420 AbstractCegarLoop]: === Iteration 572 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:49,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1056300927, now seen corresponding path program 1 times [2022-12-06 07:30:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:49,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062452539] [2022-12-06 07:30:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:49,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:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:49,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062452539] [2022-12-06 07:30:49,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062452539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:49,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:49,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209535470] [2022-12-06 07:30:49,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:49,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:49,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:49,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:49,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:49,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,031 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:50,031 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:50,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:50,045 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:50,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:50,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:50,046 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:50,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:50,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,083 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:50,083 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:50,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,084 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,109 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:50,109 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:50,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:50,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:50,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:30:50,244 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:50,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2022-12-06 07:30:50,245 INFO L420 AbstractCegarLoop]: === Iteration 573 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash 686509408, now seen corresponding path program 1 times [2022-12-06 07:30:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199120162] [2022-12-06 07:30:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199120162] [2022-12-06 07:30:50,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199120162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434195770] [2022-12-06 07:30:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:50,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:50,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:50,589 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:50,589 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:50,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:50,603 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:50,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:50,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:50,604 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:50,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:50,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:50,638 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:50,638 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:50,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:50,639 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:50,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:50,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,664 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:50,665 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:30:50,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:50,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:50,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:50,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:50,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:30:50,814 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:50,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:50,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:50,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2022-12-06 07:30:50,814 INFO L420 AbstractCegarLoop]: === Iteration 574 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1865647553, now seen corresponding path program 1 times [2022-12-06 07:30:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:50,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896732936] [2022-12-06 07:30:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:50,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:30:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:50,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896732936] [2022-12-06 07:30:50,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896732936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:50,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:50,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865715786] [2022-12-06 07:30:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:50,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:50,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:50,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:50,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:50,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,161 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:51,161 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:51,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:51,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:51,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:51,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:51,178 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:51,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:51,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,213 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:51,214 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:51,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,214 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,240 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:51,240 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:30:51,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:51,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:51,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:30:51,387 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:51,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2022-12-06 07:30:51,388 INFO L420 AbstractCegarLoop]: === Iteration 575 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash -122837218, now seen corresponding path program 1 times [2022-12-06 07:30:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712357965] [2022-12-06 07:30:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:51,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:30:51,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:51,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712357965] [2022-12-06 07:30:51,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712357965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:51,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:51,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:51,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062360779] [2022-12-06 07:30:51,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:51,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:51,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:51,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:51,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:51,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:51,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:51,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:51,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:51,761 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:51,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:51,777 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:51,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:51,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:51,778 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:51,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:51,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:51,824 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:51,824 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:51,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:51,824 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:51,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:51,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,850 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:51,850 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:30:51,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:51,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:51,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:51,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:51,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:30:51,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:51,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:51,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:51,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2022-12-06 07:30:51,997 INFO L420 AbstractCegarLoop]: === Iteration 576 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1619973117, now seen corresponding path program 1 times [2022-12-06 07:30:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:51,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83339769] [2022-12-06 07:30:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83339769] [2022-12-06 07:30:52,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83339769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501305313] [2022-12-06 07:30:52,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:52,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:52,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,378 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:52,378 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:30:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:52,393 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:52,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:52,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:52,394 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:52,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:52,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:52,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:52,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:52,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:52,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:52,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:52,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:52,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:52,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:52,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:52,462 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:52,462 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:30:52,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:52,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:52,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:52,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:52,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:30:52,603 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:52,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:52,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:52,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2022-12-06 07:30:52,603 INFO L420 AbstractCegarLoop]: === Iteration 577 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -932183844, now seen corresponding path program 1 times [2022-12-06 07:30:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045780278] [2022-12-06 07:30:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:52,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:30:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:52,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045780278] [2022-12-06 07:30:52,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045780278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:52,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:52,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926263451] [2022-12-06 07:30:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:52,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:52,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:52,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:52,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:52,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:52,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:52,956 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:52,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:52,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:52,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:52,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:52,971 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:52,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:53,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:53,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:53,009 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:53,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:53,009 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:53,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:53,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,039 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:53,039 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:30:53,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:53,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:53,209 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 07:30:53,209 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:53,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2022-12-06 07:30:53,210 INFO L420 AbstractCegarLoop]: === Iteration 578 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 810626491, now seen corresponding path program 1 times [2022-12-06 07:30:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829593244] [2022-12-06 07:30:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829593244] [2022-12-06 07:30:53,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829593244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:53,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343580351] [2022-12-06 07:30:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:53,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:53,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:53,567 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:53,567 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:53,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:53,581 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:53,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:53,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:53,582 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:53,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:53,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:53,617 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:53,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:53,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:53,618 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:53,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:53,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,643 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:53,643 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:53,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:53,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:53,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:53,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:53,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:30:53,781 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:53,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:53,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2022-12-06 07:30:53,782 INFO L420 AbstractCegarLoop]: === Iteration 579 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1741530470, now seen corresponding path program 1 times [2022-12-06 07:30:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228447066] [2022-12-06 07:30:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:53,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:30:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:53,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228447066] [2022-12-06 07:30:53,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228447066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:53,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:53,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626980665] [2022-12-06 07:30:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:53,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:53,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:53,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:53,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:53,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:54,128 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:54,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:54,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:54,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:54,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:54,143 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:54,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:54,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,178 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:54,178 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:54,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,178 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,211 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:54,211 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:30:54,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:54,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:54,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:30:54,361 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:54,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2022-12-06 07:30:54,362 INFO L420 AbstractCegarLoop]: === Iteration 580 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1279865, now seen corresponding path program 1 times [2022-12-06 07:30:54,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95589993] [2022-12-06 07:30:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:54,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:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:54,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95589993] [2022-12-06 07:30:54,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95589993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:54,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:54,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294891885] [2022-12-06 07:30:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:54,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:54,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:54,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:54,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:54,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:54,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:54,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:54,714 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:54,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:54,728 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:54,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:54,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:54,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:54,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:54,767 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:54,768 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:54,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:54,768 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:54,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:54,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,793 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:54,793 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:30:54,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:54,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:54,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:54,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:54,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:30:54,943 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:54,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:54,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2022-12-06 07:30:54,943 INFO L420 AbstractCegarLoop]: === Iteration 581 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1744090200, now seen corresponding path program 1 times [2022-12-06 07:30:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026443947] [2022-12-06 07:30:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,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:30:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026443947] [2022-12-06 07:30:55,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026443947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489287969] [2022-12-06 07:30:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:55,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:55,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:55,297 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:55,297 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:30:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:55,311 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:55,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:55,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:55,312 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:55,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:55,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:55,351 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:55,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:55,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:55,351 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:55,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:55,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,384 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:55,384 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:30:55,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:55,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:55,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:55,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:30:55,530 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:55,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:55,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:55,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2022-12-06 07:30:55,530 INFO L420 AbstractCegarLoop]: === Iteration 582 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -808066761, now seen corresponding path program 1 times [2022-12-06 07:30:55,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:55,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832954499] [2022-12-06 07:30:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:55,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:30:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:55,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832954499] [2022-12-06 07:30:55,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832954499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:55,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:55,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194350881] [2022-12-06 07:30:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:55,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:55,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:55,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:55,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:55,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:55,873 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:55,873 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:55,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:55,889 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:55,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:55,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:55,890 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:55,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:55,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:55,929 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:55,929 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:55,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:55,929 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:55,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:55,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,955 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:55,955 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:30:55,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:55,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:55,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:56,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:30:56,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:56,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2022-12-06 07:30:56,106 INFO L420 AbstractCegarLoop]: === Iteration 583 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 934743574, now seen corresponding path program 1 times [2022-12-06 07:30:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303843972] [2022-12-06 07:30:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:56,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:30:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303843972] [2022-12-06 07:30:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303843972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193138574] [2022-12-06 07:30:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:56,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:56,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:56,447 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:56,447 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:56,461 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:56,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:56,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:56,462 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:56,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:56,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:56,500 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:56,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:56,500 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:56,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:56,500 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:56,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:56,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:56,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:56,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:56,531 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:56,531 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:30:56,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:56,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:56,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:56,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:56,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 07:30:56,703 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:56,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:56,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:56,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2022-12-06 07:30:56,703 INFO L420 AbstractCegarLoop]: === Iteration 584 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1617413387, now seen corresponding path program 1 times [2022-12-06 07:30:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:56,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569449990] [2022-12-06 07:30:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30: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:30:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:56,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569449990] [2022-12-06 07:30:56,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569449990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:56,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:56,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912356893] [2022-12-06 07:30:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:56,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:56,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:56,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:56,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,036 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:57,036 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:57,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:57,051 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:57,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:57,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:57,051 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:57,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:57,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,090 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:57,090 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:57,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,090 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,116 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:57,116 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:30:57,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:57,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:57,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:30:57,257 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:57,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2022-12-06 07:30:57,258 INFO L420 AbstractCegarLoop]: === Iteration 585 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:57,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 125396948, now seen corresponding path program 1 times [2022-12-06 07:30:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860337461] [2022-12-06 07:30:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,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:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860337461] [2022-12-06 07:30:57,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860337461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080427995] [2022-12-06 07:30:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:57,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:57,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:57,591 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:57,591 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:30:57,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:57,605 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:57,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:57,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:57,606 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:57,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:57,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:57,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:57,642 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:57,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:57,642 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:57,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:57,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,672 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:57,672 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:30:57,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:30:57,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:57,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:57,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:57,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:30:57,816 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:57,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:57,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:57,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2022-12-06 07:30:57,816 INFO L420 AbstractCegarLoop]: === Iteration 586 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1868207283, now seen corresponding path program 1 times [2022-12-06 07:30:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:57,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145456364] [2022-12-06 07:30:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:57,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:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:57,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145456364] [2022-12-06 07:30:57,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145456364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:57,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:57,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625501586] [2022-12-06 07:30:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:57,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:57,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:57,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:57,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,153 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:58,153 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:58,168 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:58,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:58,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:58,169 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:58,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:58,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,205 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:58,205 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:58,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,205 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,231 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:58,231 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:30:58,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:58,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:58,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:30:58,384 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:58,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2022-12-06 07:30:58,384 INFO L420 AbstractCegarLoop]: === Iteration 587 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -683949678, now seen corresponding path program 1 times [2022-12-06 07:30:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437904229] [2022-12-06 07:30:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:58,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:30:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437904229] [2022-12-06 07:30:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437904229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:58,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:58,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114970106] [2022-12-06 07:30:58,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:58,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:58,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:58,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:58,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:58,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:58,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:58,725 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:58,725 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:30:58,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:58,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:58,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:58,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:58,740 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:58,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:58,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:58,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:58,781 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:58,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:58,781 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:58,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:58,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,811 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:58,811 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:30:58,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:58,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:58,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:58,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:58,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:30:58,972 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:58,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:58,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:58,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2022-12-06 07:30:58,972 INFO L420 AbstractCegarLoop]: === Iteration 588 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1058860657, now seen corresponding path program 1 times [2022-12-06 07:30:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:58,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959950033] [2022-12-06 07:30:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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:30:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959950033] [2022-12-06 07:30:59,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959950033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617855141] [2022-12-06 07:30:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:59,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:59,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:59,318 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:30:59,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:59,332 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:59,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:59,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:59,333 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:59,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:59,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,370 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:59,371 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:59,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,371 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,396 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:30:59,397 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:30:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:30:59,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:30:59,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:30:59,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:30:59,541 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:30:59,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:30:59,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:30:59,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2022-12-06 07:30:59,541 INFO L420 AbstractCegarLoop]: === Iteration 589 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:30:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:30:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1493296304, now seen corresponding path program 1 times [2022-12-06 07:30:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:30:59,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680884495] [2022-12-06 07:30:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:30:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:30:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:30:59,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:30:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:30:59,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680884495] [2022-12-06 07:30:59,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680884495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:30:59,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:30:59,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:30:59,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206607688] [2022-12-06 07:30:59,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:30:59,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:30:59,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:30:59,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:30:59,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:30:59,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:30:59,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:30:59,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:30:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:30:59,899 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:30:59,900 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:30:59,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:30:59,915 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:30:59,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:59,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:30:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:30:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:30:59,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:30:59,916 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:30:59,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:30:59,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:30:59,972 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:30:59,972 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:30:59,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:30:59,972 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:30:59,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:30:59,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:30:59,999 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:30:59,999 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:31:00,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:00,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:00,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:00,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:00,144 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:00,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2022-12-06 07:31:00,144 INFO L420 AbstractCegarLoop]: === Iteration 590 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 249514031, now seen corresponding path program 1 times [2022-12-06 07:31:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340087332] [2022-12-06 07:31:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340087332] [2022-12-06 07:31:00,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340087332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334993895] [2022-12-06 07:31:00,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:00,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:00,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:00,481 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:00,481 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:00,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:00,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:00,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:00,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:00,496 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:00,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:00,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:00,532 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:00,532 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:00,533 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:00,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:00,533 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:00,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:00,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:00,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:00,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:00,559 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:00,559 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:31:00,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:00,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:00,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:00,701 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:00,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:31:00,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:00,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:00,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:00,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2022-12-06 07:31:00,702 INFO L420 AbstractCegarLoop]: === Iteration 591 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1992324366, now seen corresponding path program 1 times [2022-12-06 07:31:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:00,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241104553] [2022-12-06 07:31:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:00,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:31:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241104553] [2022-12-06 07:31:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241104553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:00,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:00,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278344388] [2022-12-06 07:31:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:00,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:00,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:00,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:00,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:00,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:00,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,057 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:01,058 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:01,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:01,069 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:01,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:01,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:01,070 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:01,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:01,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,105 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:01,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:01,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,131 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:01,131 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:31:01,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:01,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:01,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:31:01,281 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:01,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2022-12-06 07:31:01,281 INFO L420 AbstractCegarLoop]: === Iteration 592 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash -559832595, now seen corresponding path program 1 times [2022-12-06 07:31:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109941078] [2022-12-06 07:31:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:01,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:31:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109941078] [2022-12-06 07:31:01,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109941078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342585628] [2022-12-06 07:31:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:01,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:01,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:01,617 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:01,617 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:01,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:01,632 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:01,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:01,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:01,632 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:01,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:01,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:01,668 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:01,668 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:01,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:01,668 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:01,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:01,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,694 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:01,694 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:31:01,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:01,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:01,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:01,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:01,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:01,841 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:01,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:01,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:01,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2022-12-06 07:31:01,841 INFO L420 AbstractCegarLoop]: === Iteration 593 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1182977740, now seen corresponding path program 1 times [2022-12-06 07:31:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153752996] [2022-12-06 07:31:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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:31:01,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:01,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153752996] [2022-12-06 07:31:01,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153752996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:01,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:01,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217217440] [2022-12-06 07:31:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:01,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:01,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:01,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:01,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,206 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:02,206 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:02,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:02,218 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:02,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:02,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:02,219 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:02,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:02,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:02,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:02,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,253 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,279 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:02,279 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:31:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:02,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:02,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:31:02,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2022-12-06 07:31:02,421 INFO L420 AbstractCegarLoop]: === Iteration 594 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:02,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1369179221, now seen corresponding path program 1 times [2022-12-06 07:31:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219940833] [2022-12-06 07:31:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:02,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:31:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219940833] [2022-12-06 07:31:02,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219940833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:02,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:02,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795174659] [2022-12-06 07:31:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:02,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:02,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:02,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:02,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:02,764 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:02,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:02,778 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:02,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:02,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:02,779 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:02,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:02,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:02,817 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,817 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:02,817 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:02,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:02,817 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:02,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:02,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,843 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:02,843 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:02,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:02,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:02,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:02,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:31:02,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:02,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:02,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:02,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2022-12-06 07:31:02,989 INFO L420 AbstractCegarLoop]: === Iteration 595 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 373631114, now seen corresponding path program 1 times [2022-12-06 07:31:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:02,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571185571] [2022-12-06 07:31:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,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:03,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571185571] [2022-12-06 07:31:03,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571185571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014248888] [2022-12-06 07:31:03,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:03,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:03,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:03,354 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:03,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13510 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:03,366 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:03,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:03,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:03,366 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:03,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:03,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,397 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:03,397 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:03,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,397 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,422 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:03,422 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:03,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:03,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:03,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:03,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:03,562 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:03,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:03,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:03,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2022-12-06 07:31:03,563 INFO L420 AbstractCegarLoop]: === Iteration 596 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2116441449, now seen corresponding path program 1 times [2022-12-06 07:31:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:03,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659314602] [2022-12-06 07:31:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:03,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:03,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659314602] [2022-12-06 07:31:03,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659314602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:03,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:03,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707576499] [2022-12-06 07:31:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:03,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:03,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:03,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:03,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:03,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:03,911 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:03,925 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:03,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:03,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:03,926 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:03,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:03,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:03,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:03,964 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:03,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:03,964 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:03,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:03,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,990 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:03,990 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:03,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:03,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:03,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:04,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:31:04,142 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:04,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2022-12-06 07:31:04,143 INFO L420 AbstractCegarLoop]: === Iteration 597 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash -435715512, now seen corresponding path program 1 times [2022-12-06 07:31:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524830479] [2022-12-06 07:31:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,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:31:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524830479] [2022-12-06 07:31:04,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524830479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604043485] [2022-12-06 07:31:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:04,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:04,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:04,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:04,498 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:04,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:04,514 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:04,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:04,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:04,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:04,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:04,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:04,555 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:04,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:04,555 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:04,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:04,556 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:04,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:04,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:04,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:04,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:04,582 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:04,582 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:31:04,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:04,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:04,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:04,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:04,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:31:04,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:04,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:04,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:04,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2022-12-06 07:31:04,736 INFO L420 AbstractCegarLoop]: === Iteration 598 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:04,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1307094823, now seen corresponding path program 1 times [2022-12-06 07:31:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:04,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034920538] [2022-12-06 07:31:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:04,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:31:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:04,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034920538] [2022-12-06 07:31:04,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034920538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:04,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:04,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:04,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322553352] [2022-12-06 07:31:04,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:04,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:04,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:04,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:04,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:04,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,088 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:05,088 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:05,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:05,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:05,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:05,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:05,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:05,103 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:05,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:05,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,139 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:05,139 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:05,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,139 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,164 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:05,164 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:31:05,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:05,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:05,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:05,311 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:05,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2022-12-06 07:31:05,311 INFO L420 AbstractCegarLoop]: === Iteration 599 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1245062138, now seen corresponding path program 1 times [2022-12-06 07:31:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923821338] [2022-12-06 07:31:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,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:05,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923821338] [2022-12-06 07:31:05,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923821338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898475885] [2022-12-06 07:31:05,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:05,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:05,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:05,652 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:05,652 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:05,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:05,665 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:05,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:05,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:05,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:05,666 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:05,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:05,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:05,702 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:05,702 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:05,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:05,702 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:05,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:05,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,729 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:05,729 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:31:05,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:05,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:05,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:05,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:05,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:31:05,869 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:05,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:05,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:05,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2022-12-06 07:31:05,869 INFO L420 AbstractCegarLoop]: === Iteration 600 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash 497748197, now seen corresponding path program 1 times [2022-12-06 07:31:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:05,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308423520] [2022-12-06 07:31:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308423520] [2022-12-06 07:31:05,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308423520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:05,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:05,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852246877] [2022-12-06 07:31:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:05,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:05,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:05,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:05,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:05,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:05,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:05,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:06,231 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:06,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:06,244 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:06,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:06,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:06,245 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:06,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:06,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,282 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:06,282 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:06,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,282 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,308 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:06,308 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:06,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:06,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:06,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:06,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:31:06,462 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:06,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:06,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:06,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2022-12-06 07:31:06,462 INFO L420 AbstractCegarLoop]: === Iteration 601 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2054408764, now seen corresponding path program 1 times [2022-12-06 07:31:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100026938] [2022-12-06 07:31:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:06,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:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:06,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100026938] [2022-12-06 07:31:06,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100026938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:06,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:06,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055358284] [2022-12-06 07:31:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:06,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:06,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:06,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:06,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:06,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:06,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:06,806 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:06,807 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:06,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:06,820 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:06,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:06,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:06,821 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:06,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:06,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:06,856 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:06,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:06,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:06,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:06,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:06,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,882 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:06,882 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:31:06,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:06,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:06,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:07,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:31:07,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:07,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2022-12-06 07:31:07,037 INFO L420 AbstractCegarLoop]: === Iteration 602 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [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 -311598429, 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,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218944195] [2022-12-06 07:31:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218944195] [2022-12-06 07:31:07,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218944195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:07,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681558840] [2022-12-06 07:31:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:07,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:07,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,358 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:07,358 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:07,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:07,371 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:07,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:07,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:07,372 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:07,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:07,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,408 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:07,408 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:07,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,408 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,434 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:07,434 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:07,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:07,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:07,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:07,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:31:07,589 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:07,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:07,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:07,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2022-12-06 07:31:07,590 INFO L420 AbstractCegarLoop]: === Iteration 603 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1431211906, now seen corresponding path program 1 times [2022-12-06 07:31:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756052549] [2022-12-06 07:31:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:07,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:31:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:07,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756052549] [2022-12-06 07:31:07,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756052549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:07,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:07,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369462478] [2022-12-06 07:31:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:07,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:07,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:07,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:07,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:07,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:07,939 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:07,939 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:31:07,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13525 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:07,953 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:07,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:07,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:07,954 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:07,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:07,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:07,988 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:07,988 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:07,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:07,988 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:07,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:07,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:07,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,014 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:08,014 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:31:08,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:08,017 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,017 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:08,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:31:08,164 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:08,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2022-12-06 07:31:08,165 INFO L420 AbstractCegarLoop]: === Iteration 604 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1120945055, now seen corresponding path program 1 times [2022-12-06 07:31:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338683243] [2022-12-06 07:31:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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:31:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338683243] [2022-12-06 07:31:08,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338683243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:08,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437853610] [2022-12-06 07:31:08,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:08,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:08,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:08,500 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:08,500 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:08,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:08,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:08,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:08,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:08,514 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:08,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:08,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:08,550 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:08,550 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:08,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:08,551 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:08,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:08,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,576 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:08,576 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:08,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:08,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:08,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:08,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:31:08,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:08,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:08,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2022-12-06 07:31:08,732 INFO L420 AbstractCegarLoop]: === Iteration 605 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 621865280, now seen corresponding path program 1 times [2022-12-06 07:31:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191535605] [2022-12-06 07:31:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:08,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:31:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:08,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191535605] [2022-12-06 07:31:08,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191535605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:08,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:08,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300006564] [2022-12-06 07:31:08,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:08,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:08,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:08,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:08,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:08,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:09,097 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:09,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:09,113 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:09,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:09,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:09,113 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:09,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:09,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,150 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:09,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:09,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,178 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:09,178 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:31:09,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:09,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:09,331 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:31:09,331 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:09,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2022-12-06 07:31:09,331 INFO L420 AbstractCegarLoop]: === Iteration 606 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1930291681, now seen corresponding path program 1 times [2022-12-06 07:31:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673080819] [2022-12-06 07:31:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673080819] [2022-12-06 07:31:09,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673080819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241273519] [2022-12-06 07:31:09,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:09,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:09,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:09,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:09,666 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:09,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:09,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:09,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:09,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:09,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:09,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:09,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:09,716 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:09,716 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:09,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:09,716 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:09,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:09,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,742 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:09,743 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:09,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:09,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:09,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:09,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:09,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:31:09,886 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:09,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:09,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:09,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2022-12-06 07:31:09,887 INFO L420 AbstractCegarLoop]: === Iteration 607 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash -187481346, now seen corresponding path program 1 times [2022-12-06 07:31:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:09,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641414840] [2022-12-06 07:31:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:09,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:31:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641414840] [2022-12-06 07:31:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641414840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:09,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:09,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425192314] [2022-12-06 07:31:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:09,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:09,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:09,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:09,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:10,231 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:10,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:10,246 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:10,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:10,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:10,247 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:10,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:10,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,285 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,285 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:10,285 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:10,285 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,285 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,311 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:10,311 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:31:10,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:10,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:10,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:10,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:31:10,462 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:10,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:10,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:10,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2022-12-06 07:31:10,462 INFO L420 AbstractCegarLoop]: === Iteration 608 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1555328989, now seen corresponding path program 1 times [2022-12-06 07:31:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:10,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978545371] [2022-12-06 07:31:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:10,462 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,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:31:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:10,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978545371] [2022-12-06 07:31:10,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978545371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:10,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:10,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402577577] [2022-12-06 07:31:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:10,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:10,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:10,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:10,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:10,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:10,794 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:10,794 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:10,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:10,807 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:10,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:10,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:10,808 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:10,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:10,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:10,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:10,842 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:10,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:10,842 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:10,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:10,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,867 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:10,867 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:31:10,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:10,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:10,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:11,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:31:11,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2022-12-06 07:31:11,028 INFO L420 AbstractCegarLoop]: === Iteration 609 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [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 -996827972, 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,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398330828] [2022-12-06 07:31:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,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:31:11,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398330828] [2022-12-06 07:31:11,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398330828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101129110] [2022-12-06 07:31:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:11,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:11,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:11,374 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:11,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:11,389 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:11,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:11,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:11,390 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:11,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,427 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:11,427 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:11,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,427 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,453 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:11,453 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:31:11,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:11,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:11,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:11,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:31:11,597 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:11,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:11,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:11,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2022-12-06 07:31:11,598 INFO L420 AbstractCegarLoop]: === Iteration 610 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 745982363, now seen corresponding path program 1 times [2022-12-06 07:31:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:11,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625533961] [2022-12-06 07:31:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:11,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:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:11,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625533961] [2022-12-06 07:31:11,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625533961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:11,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:11,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669786043] [2022-12-06 07:31:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:11,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:11,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:11,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:11,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:11,933 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:11,933 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:11,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:11,948 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:11,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:11,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:11,949 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:11,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:11,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:11,986 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:11,987 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:11,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:11,987 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:11,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:11,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,018 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:12,018 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:12,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:12,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:12,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:31:12,160 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:12,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2022-12-06 07:31:12,160 INFO L420 AbstractCegarLoop]: === Iteration 611 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1806174598, now seen corresponding path program 1 times [2022-12-06 07:31:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294818806] [2022-12-06 07:31:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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:31:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294818806] [2022-12-06 07:31:12,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294818806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322228489] [2022-12-06 07:31:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:12,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:12,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:12,511 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:12,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:12,525 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:12,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:12,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:12,526 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:12,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:12,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:12,564 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:12,564 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:12,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:12,564 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:12,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:12,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,589 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:12,589 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:31:12,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:12,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:12,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:12,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:12,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:12,729 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:12,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:12,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:12,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2022-12-06 07:31:12,730 INFO L420 AbstractCegarLoop]: === Iteration 612 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -63364263, now seen corresponding path program 1 times [2022-12-06 07:31:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:12,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219446958] [2022-12-06 07:31:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:12,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:31:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:12,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219446958] [2022-12-06 07:31:12,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219446958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:12,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:12,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856834618] [2022-12-06 07:31:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:12,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:12,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:12,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:12,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:12,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:12,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,098 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:13,098 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:13,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:13,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:13,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:13,112 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:13,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:13,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,150 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:13,155 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:13,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,155 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,181 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:13,181 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:13,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:13,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:13,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:31:13,335 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:13,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2022-12-06 07:31:13,335 INFO L420 AbstractCegarLoop]: === Iteration 613 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1679446072, now seen corresponding path program 1 times [2022-12-06 07:31:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333228488] [2022-12-06 07:31:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:13,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:31:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:13,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333228488] [2022-12-06 07:31:13,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333228488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:13,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:13,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474388885] [2022-12-06 07:31:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:13,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:13,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:13,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:13,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:13,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:13,693 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:13,693 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:13,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:13,715 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:13,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:13,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:13,716 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:13,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:13,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:13,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:13,761 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:13,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:13,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:13,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:13,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,788 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:13,788 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:31:13,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:13,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:13,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:13,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:13,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:13,934 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:13,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:13,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:13,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2022-12-06 07:31:13,934 INFO L420 AbstractCegarLoop]: === Iteration 614 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -872710889, now seen corresponding path program 1 times [2022-12-06 07:31:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:13,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771601275] [2022-12-06 07:31:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771601275] [2022-12-06 07:31:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771601275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:14,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805485419] [2022-12-06 07:31:14,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:14,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:14,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,270 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:14,270 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:14,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:14,284 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:14,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:14,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:14,284 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:14,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:14,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:14,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:14,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,345 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:14,345 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:31:14,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:14,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:14,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:14,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:31:14,477 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:14,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:14,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:14,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2022-12-06 07:31:14,478 INFO L420 AbstractCegarLoop]: === Iteration 615 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash 870099446, now seen corresponding path program 1 times [2022-12-06 07:31:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:14,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826030749] [2022-12-06 07:31:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:14,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:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:14,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826030749] [2022-12-06 07:31:14,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826030749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:14,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:14,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015355156] [2022-12-06 07:31:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:14,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:14,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:14,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:14,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:14,812 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:14,812 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:14,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:14,826 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:14,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:14,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:14,827 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:14,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:14,864 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:14,864 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:14,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:14,864 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:14,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:14,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,890 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:14,890 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:31:14,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:14,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:14,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:15,029 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:31:15,030 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:15,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2022-12-06 07:31:15,030 INFO L420 AbstractCegarLoop]: === Iteration 616 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1682057515, now seen corresponding path program 1 times [2022-12-06 07:31:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794856273] [2022-12-06 07:31:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:15,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:31:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794856273] [2022-12-06 07:31:15,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794856273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:15,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427762250] [2022-12-06 07:31:15,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:15,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:15,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,380 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:15,380 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:31:15,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:15,394 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:15,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:15,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:15,394 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:15,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:15,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:15,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:15,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,431 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,456 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:15,456 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:31:15,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:15,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:15,607 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:15,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:31:15,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:15,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:15,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2022-12-06 07:31:15,608 INFO L420 AbstractCegarLoop]: === Iteration 617 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 60752820, now seen corresponding path program 1 times [2022-12-06 07:31:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:15,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220476987] [2022-12-06 07:31:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:15,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:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:15,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220476987] [2022-12-06 07:31:15,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220476987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:15,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:15,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933897020] [2022-12-06 07:31:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:15,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:15,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:15,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:15,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:15,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:15,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:15,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:15,946 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:15,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:15,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:15,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:15,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:15,960 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:15,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:15,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:15,996 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:15,996 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:15,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:15,996 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:15,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:15,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:15,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,021 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:16,021 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:31:16,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:16,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:16,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:31:16,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:16,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2022-12-06 07:31:16,175 INFO L420 AbstractCegarLoop]: === Iteration 618 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1803563155, now seen corresponding path program 1 times [2022-12-06 07:31:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018090646] [2022-12-06 07:31:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,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:31:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018090646] [2022-12-06 07:31:16,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018090646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170755062] [2022-12-06 07:31:16,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:16,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:16,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:16,503 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:16,503 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:16,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:16,517 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:16,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:16,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:16,518 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:16,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:16,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:16,555 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:16,555 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:16,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:16,556 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:16,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:16,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,581 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:16,581 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:31:16,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:16,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:16,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:16,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:16,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:31:16,738 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:16,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:16,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:16,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2022-12-06 07:31:16,738 INFO L420 AbstractCegarLoop]: === Iteration 619 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash -748593806, now seen corresponding path program 1 times [2022-12-06 07:31:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:16,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067513664] [2022-12-06 07:31:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:16,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:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:16,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067513664] [2022-12-06 07:31:16,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067513664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:16,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:16,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122828365] [2022-12-06 07:31:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:16,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:16,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:16,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:16,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:16,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,085 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:17,086 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:17,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13585 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:17,100 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:17,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:17,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:17,101 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:17,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:17,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,140 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:17,140 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:17,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,140 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,166 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:17,167 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:31:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:17,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:17,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:31:17,327 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:17,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2022-12-06 07:31:17,328 INFO L420 AbstractCegarLoop]: === Iteration 620 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 994216529, now seen corresponding path program 1 times [2022-12-06 07:31:17,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035895905] [2022-12-06 07:31:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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:31:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035895905] [2022-12-06 07:31:17,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035895905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714333081] [2022-12-06 07:31:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:17,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:17,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:17,660 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:17,660 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:17,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:17,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:17,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:17,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:17,674 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:17,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:17,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:17,709 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:17,709 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:17,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:17,709 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:17,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:17,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,742 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:17,742 INFO L131 PetriNetUnfolder]: For 3297/3507 co-relation queries the response was YES. [2022-12-06 07:31:17,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3297/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:17,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:17,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:17,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:17,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:31:17,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:17,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:17,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:17,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2022-12-06 07:31:17,883 INFO L420 AbstractCegarLoop]: === Iteration 621 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1557940432, now seen corresponding path program 1 times [2022-12-06 07:31:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:17,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672233582] [2022-12-06 07:31:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:17,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672233582] [2022-12-06 07:31:17,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672233582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:17,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:17,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:17,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562414872] [2022-12-06 07:31:17,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:17,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:17,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:17,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:17,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:17,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:17,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,222 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:18,222 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:18,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:18,236 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:18,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:18,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:18,237 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:18,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:18,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,275 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:18,275 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:18,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,275 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,300 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:18,300 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:31:18,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:18,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:18,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:18,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:31:18,443 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:18,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:18,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:18,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2022-12-06 07:31:18,443 INFO L420 AbstractCegarLoop]: === Iteration 622 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 184869903, now seen corresponding path program 1 times [2022-12-06 07:31:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:18,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167817972] [2022-12-06 07:31:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:18,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:18,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:18,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167817972] [2022-12-06 07:31:18,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167817972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:18,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:18,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709293764] [2022-12-06 07:31:18,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:18,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:18,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:18,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:18,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:18,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:18,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:18,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:18,775 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:18,775 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:18,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:18,789 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:18,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:18,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:18,790 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:18,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:18,827 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:18,827 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:18,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:18,827 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:18,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:18,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,860 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:18,860 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:18,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:18,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:18,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:19,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:31:19,016 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:19,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2022-12-06 07:31:19,017 INFO L420 AbstractCegarLoop]: === Iteration 623 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1927680238, now seen corresponding path program 1 times [2022-12-06 07:31:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205463698] [2022-12-06 07:31:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:19,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:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205463698] [2022-12-06 07:31:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205463698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959919185] [2022-12-06 07:31:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:19,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:19,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,360 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:19,361 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:19,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:19,374 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:19,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:19,375 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:19,375 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:19,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:19,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,413 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:19,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:19,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,413 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,438 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:19,438 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:31:19,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:19,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:19,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:19,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:31:19,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:19,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:19,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:19,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2022-12-06 07:31:19,587 INFO L420 AbstractCegarLoop]: === Iteration 624 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash -624476723, now seen corresponding path program 1 times [2022-12-06 07:31:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:19,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043785885] [2022-12-06 07:31:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:19,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:19,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:31:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:19,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043785885] [2022-12-06 07:31:19,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043785885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:19,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:19,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365490724] [2022-12-06 07:31:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:19,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:19,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:19,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:19,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:19,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:19,915 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:19,915 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:19,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:19,929 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:19,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:19,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:19,930 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:19,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:19,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:19,966 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:19,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:19,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:19,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:19,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:19,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,995 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:19,996 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:31:19,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:19,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:19,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:20,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:31:20,139 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:20,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2022-12-06 07:31:20,139 INFO L420 AbstractCegarLoop]: === Iteration 625 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1118333612, now seen corresponding path program 1 times [2022-12-06 07:31:20,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742088721] [2022-12-06 07:31:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,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:31:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742088721] [2022-12-06 07:31:20,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742088721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351445393] [2022-12-06 07:31:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:20,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:20,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:20,473 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:20,473 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:20,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:20,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:20,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:20,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:20,487 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:20,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:20,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:20,521 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:20,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:20,521 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:20,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:20,521 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:20,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:20,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:20,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:20,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:20,547 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:20,547 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:31:20,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:20,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:20,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:20,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:20,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:31:20,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:20,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:20,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:20,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2022-12-06 07:31:20,701 INFO L420 AbstractCegarLoop]: === Iteration 626 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1433823349, now seen corresponding path program 1 times [2022-12-06 07:31:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:20,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338671935] [2022-12-06 07:31:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:20,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:20,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:31:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:20,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338671935] [2022-12-06 07:31:20,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338671935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:20,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:20,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427380495] [2022-12-06 07:31:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:20,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:20,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:20,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:20,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:20,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:20,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:20,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:21,034 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:21,034 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:21,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:21,049 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:21,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:21,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:21,050 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:21,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:21,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:21,103 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:21,103 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:21,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:21,103 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:21,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:21,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,130 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:21,130 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:21,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:21,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:31:21,266 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:21,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2022-12-06 07:31:21,266 INFO L420 AbstractCegarLoop]: === Iteration 627 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 308986986, now seen corresponding path program 1 times [2022-12-06 07:31:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428411635] [2022-12-06 07:31:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:21,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:31:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:21,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428411635] [2022-12-06 07:31:21,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428411635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:21,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:21,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522978621] [2022-12-06 07:31:21,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:21,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:21,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:21,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:21,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:21,637 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:21,638 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:21,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:21,656 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:21,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:21,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:21,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:21,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:21,703 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:21,704 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:21,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:21,704 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:21,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:21,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,729 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:21,729 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:21,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:21,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:21,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:21,879 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:21,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:31:21,880 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:21,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:21,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2022-12-06 07:31:21,880 INFO L420 AbstractCegarLoop]: === Iteration 628 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2051797321, now seen corresponding path program 1 times [2022-12-06 07:31:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952003281] [2022-12-06 07:31:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:21,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:31:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:21,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952003281] [2022-12-06 07:31:21,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952003281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:21,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:21,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:21,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985811492] [2022-12-06 07:31:21,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:21,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:21,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:21,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:21,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:21,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:21,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,232 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:22,232 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:22,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:22,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:22,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:22,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:22,244 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:22,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:22,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,276 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:22,276 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:22,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,276 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,301 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:22,301 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:31:22,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:22,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:22,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:22,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:22,441 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:22,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:22,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:22,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2022-12-06 07:31:22,441 INFO L420 AbstractCegarLoop]: === Iteration 629 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash -500359640, now seen corresponding path program 1 times [2022-12-06 07:31:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:22,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172935495] [2022-12-06 07:31:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:22,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:31:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172935495] [2022-12-06 07:31:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172935495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:22,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:22,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872804985] [2022-12-06 07:31:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:22,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:22,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:22,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:22,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:22,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:22,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:22,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:22,802 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:22,802 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:22,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:22,817 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:22,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:22,817 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 69 transitions. [2022-12-06 07:31:22,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:22,817 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:22,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:22,851 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:22,851 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:22,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:22,851 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:22,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:22,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,876 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:22,877 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:31:22,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:22,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:22,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:23,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:31:23,036 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:23,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2022-12-06 07:31:23,037 INFO L420 AbstractCegarLoop]: === Iteration 630 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:23,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1242450695, now seen corresponding path program 1 times [2022-12-06 07:31:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626252243] [2022-12-06 07:31:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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:31:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626252243] [2022-12-06 07:31:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626252243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132418861] [2022-12-06 07:31:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:23,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:23,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,411 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:23,411 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:23,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:23,425 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:23,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:23,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:23,426 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:23,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:23,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:23,465 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:23,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:23,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:23,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:23,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:23,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:23,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:23,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:23,492 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:23,492 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:23,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:23,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:23,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:23,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:23,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:31:23,632 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:23,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:23,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:23,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2022-12-06 07:31:23,633 INFO L420 AbstractCegarLoop]: === Iteration 631 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1309706266, now seen corresponding path program 1 times [2022-12-06 07:31:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:23,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267702126] [2022-12-06 07:31:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:23,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:31:23,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:23,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267702126] [2022-12-06 07:31:23,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267702126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:23,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:23,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838333414] [2022-12-06 07:31:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:23,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:23,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:23,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:23,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:23,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:23,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:23,984 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:23,984 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:23,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:23,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:23,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:24,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:24,000 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:24,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:24,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,039 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:24,039 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:24,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,040 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,066 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:24,066 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:24,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:24,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:24,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:31:24,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:24,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2022-12-06 07:31:24,217 INFO L420 AbstractCegarLoop]: === Iteration 632 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash 433104069, now seen corresponding path program 1 times [2022-12-06 07:31:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538005295] [2022-12-06 07:31:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:24,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:31:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538005295] [2022-12-06 07:31:24,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538005295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490031152] [2022-12-06 07:31:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:24,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:24,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:24,582 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:24,582 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:24,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:24,594 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:24,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:24,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:24,595 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:24,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:24,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:24,628 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:24,628 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:24,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:24,628 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:24,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:24,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,653 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:24,653 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:24,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:24,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:24,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:24,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:24,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:31:24,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:24,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:24,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:24,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2022-12-06 07:31:24,796 INFO L420 AbstractCegarLoop]: === Iteration 633 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:24,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2119052892, now seen corresponding path program 1 times [2022-12-06 07:31:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:24,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137160355] [2022-12-06 07:31:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:24,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:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:24,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137160355] [2022-12-06 07:31:24,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137160355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:24,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:24,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031309123] [2022-12-06 07:31:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:24,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:24,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:24,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:24,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:24,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:24,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,126 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:25,126 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:25,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:25,140 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:25,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:25,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:25,141 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:25,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:25,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,174 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:25,174 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:25,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,174 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,199 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:25,199 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:31:25,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:25,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:25,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:25,346 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:25,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2022-12-06 07:31:25,346 INFO L420 AbstractCegarLoop]: === Iteration 634 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -376242557, now seen corresponding path program 1 times [2022-12-06 07:31:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583102596] [2022-12-06 07:31:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,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:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583102596] [2022-12-06 07:31:25,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583102596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:25,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175612634] [2022-12-06 07:31:25,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:25,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:25,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:25,705 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:25,705 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:25,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:25,718 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:25,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:25,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:25,719 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:25,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:25,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:25,755 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:25,756 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:25,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:25,756 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:25,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:25,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,781 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:25,781 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:25,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:25,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:25,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:25,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:25,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:31:25,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:25,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:25,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:25,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2022-12-06 07:31:25,927 INFO L420 AbstractCegarLoop]: === Iteration 635 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1366567778, now seen corresponding path program 1 times [2022-12-06 07:31:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:25,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725672548] [2022-12-06 07:31:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:25,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:25,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:25,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725672548] [2022-12-06 07:31:25,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725672548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:25,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:25,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:25,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507247905] [2022-12-06 07:31:25,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:25,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:25,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:25,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:25,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:25,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:25,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,262 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:26,262 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:26,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13544 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:26,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:26,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:26,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:26,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:26,276 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:26,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:26,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,312 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:26,312 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:26,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,312 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,337 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:26,337 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:26,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:26,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:26,477 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:26,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:26,477 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:26,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:26,478 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2022-12-06 07:31:26,478 INFO L420 AbstractCegarLoop]: === Iteration 636 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1185589183, now seen corresponding path program 1 times [2022-12-06 07:31:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613920624] [2022-12-06 07:31:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:26,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:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613920624] [2022-12-06 07:31:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613920624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:26,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:26,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484936352] [2022-12-06 07:31:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:26,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:26,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:26,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:26,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:26,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:26,841 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:26,854 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:26,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:26,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:26,855 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:26,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:26,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:26,892 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:26,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:26,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:26,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:26,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:26,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,918 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:26,918 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:31:26,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:26,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:26,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:27,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:31:27,068 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:27,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2022-12-06 07:31:27,068 INFO L420 AbstractCegarLoop]: === Iteration 637 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash 557221152, now seen corresponding path program 1 times [2022-12-06 07:31:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346646290] [2022-12-06 07:31:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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:31:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346646290] [2022-12-06 07:31:27,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346646290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:27,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658571788] [2022-12-06 07:31:27,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:27,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:27,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,398 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:27,398 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:27,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:27,412 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:27,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:27,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:27,412 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:27,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:27,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:27,447 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:27,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:27,447 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:27,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:27,447 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:27,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:27,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:27,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:27,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:27,472 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:27,472 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:31:27,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:27,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:27,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:27,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:27,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:27,612 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:27,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:27,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:27,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2022-12-06 07:31:27,613 INFO L420 AbstractCegarLoop]: === Iteration 638 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1994935809, now seen corresponding path program 1 times [2022-12-06 07:31:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083954344] [2022-12-06 07:31:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:27,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:31:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:27,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083954344] [2022-12-06 07:31:27,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083954344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:27,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:27,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:27,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904069240] [2022-12-06 07:31:27,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:27,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:27,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:27,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:27,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:27,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:27,957 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:27,957 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:27,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:27,969 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:27,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:27,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:27,970 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:27,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:28,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,005 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:28,005 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:28,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,005 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,030 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:28,030 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:28,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:28,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:28,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:31:28,173 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:28,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2022-12-06 07:31:28,173 INFO L420 AbstractCegarLoop]: === Iteration 639 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash -252125474, now seen corresponding path program 1 times [2022-12-06 07:31:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796625602] [2022-12-06 07:31:28,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796625602] [2022-12-06 07:31:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796625602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274983463] [2022-12-06 07:31:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:28,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:28,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:28,494 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:28,495 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:28,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:28,507 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:28,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:28,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:28,508 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:28,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:28,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:28,542 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:28,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:28,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:28,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:28,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:28,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,567 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:28,567 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:28,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:28,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:28,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:28,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:28,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:31:28,717 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:28,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:28,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2022-12-06 07:31:28,717 INFO L420 AbstractCegarLoop]: === Iteration 640 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1490684861, now seen corresponding path program 1 times [2022-12-06 07:31:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:28,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442801086] [2022-12-06 07:31:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:28,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:31:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:28,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442801086] [2022-12-06 07:31:28,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442801086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:28,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:28,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563730193] [2022-12-06 07:31:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:28,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:28,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:28,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:28,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:28,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:28,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:28,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:28,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,064 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:29,064 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:29,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13514 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:29,076 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:29,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:29,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:29,077 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:29,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,110 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:29,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:29,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,111 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,136 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:29,136 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:31:29,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:29,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:29,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:31:29,289 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:29,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2022-12-06 07:31:29,289 INFO L420 AbstractCegarLoop]: === Iteration 641 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1061472100, now seen corresponding path program 1 times [2022-12-06 07:31:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26358677] [2022-12-06 07:31:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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:31:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26358677] [2022-12-06 07:31:29,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26358677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931278211] [2022-12-06 07:31:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:29,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:29,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:29,613 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:29,613 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:29,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:29,626 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:29,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:29,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:29,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:29,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:29,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:29,663 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:29,663 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:29,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:29,663 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:29,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:29,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,688 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:29,688 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:31:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:29,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:29,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:29,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:29,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:31:29,851 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:29,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:29,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2022-12-06 07:31:29,851 INFO L420 AbstractCegarLoop]: === Iteration 642 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 681338235, now seen corresponding path program 1 times [2022-12-06 07:31:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:29,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881401291] [2022-12-06 07:31:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:29,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:29,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:31:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881401291] [2022-12-06 07:31:29,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881401291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:29,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:29,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709029884] [2022-12-06 07:31:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:29,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:29,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:29,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:29,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:29,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:29,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:29,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,168 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:30,168 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:30,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:30,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:30,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:30,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:30,181 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:30,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,213 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:30,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:30,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,239 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:30,239 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:30,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:30,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:30,377 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:31:30,377 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2022-12-06 07:31:30,378 INFO L420 AbstractCegarLoop]: === Iteration 643 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1870818726, now seen corresponding path program 1 times [2022-12-06 07:31:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514704321] [2022-12-06 07:31:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:30,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:31:30,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514704321] [2022-12-06 07:31:30,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514704321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553267826] [2022-12-06 07:31:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:30,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:30,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:30,710 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:30,710 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:30,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:30,723 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:30,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:30,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:30,723 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:30,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:30,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:30,758 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:30,758 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:30,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:30,758 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:30,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:30,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,783 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:30,783 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:31:30,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:30,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:30,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:30,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:30,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:31:30,917 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:30,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:30,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:30,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2022-12-06 07:31:30,917 INFO L420 AbstractCegarLoop]: === Iteration 644 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -128008391, now seen corresponding path program 1 times [2022-12-06 07:31:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:30,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124079102] [2022-12-06 07:31:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31: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:31:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:30,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124079102] [2022-12-06 07:31:30,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124079102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:30,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:30,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290835303] [2022-12-06 07:31:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:30,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:30,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:30,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:30,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:30,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,248 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:31,248 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:31,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:31,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:31,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:31,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:31,262 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:31,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:31,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,296 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:31,296 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:31,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,296 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,321 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:31,321 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:31:31,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:31,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:31,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:31,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:31:31,462 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:31,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:31,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:31,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2022-12-06 07:31:31,463 INFO L420 AbstractCegarLoop]: === Iteration 645 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1614801944, now seen corresponding path program 1 times [2022-12-06 07:31:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:31,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417106322] [2022-12-06 07:31:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:31,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:31,477 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 [1417106322] [2022-12-06 07:31:31,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417106322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:31,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:31,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165362316] [2022-12-06 07:31:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:31,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:31,531 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=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:31,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:31,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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: 1 of 43 [2022-12-06 07:31:31,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:31,795 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:31,795 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:31,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:31,808 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:31,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:31,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:31,809 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:31,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:31,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:31,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:31,842 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:31,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:31,842 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:31,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:31,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,869 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:31,869 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:31:31,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:31,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:31,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:32,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:31:32,005 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:32,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:32,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2022-12-06 07:31:32,005 INFO L420 AbstractCegarLoop]: === Iteration 646 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,006 INFO L85 PathProgramCache]: Analyzing trace with hash -937355017, now seen corresponding path program 1 times [2022-12-06 07:31:32,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843371397] [2022-12-06 07:31:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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:31:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843371397] [2022-12-06 07:31:32,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843371397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517751171] [2022-12-06 07:31:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:32,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:32,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,331 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:32,331 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:32,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:32,344 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:32,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:32,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:32,344 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:32,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:32,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,379 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:32,379 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:32,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,379 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,404 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:32,404 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:31:32,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:32,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:32,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:32,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:31:32,563 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:32,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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, 1, 1, 1, 1, 1] [2022-12-06 07:31:32,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2022-12-06 07:31:32,564 INFO L420 AbstractCegarLoop]: === Iteration 647 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 805455318, now seen corresponding path program 1 times [2022-12-06 07:31:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154171826] [2022-12-06 07:31:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:32,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:31:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:32,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154171826] [2022-12-06 07:31:32,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154171826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:32,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:32,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:32,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561252030] [2022-12-06 07:31:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:32,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:32,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:32,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:32,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:32,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:32,897 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:32,897 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:32,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:32,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:32,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:32,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:32,910 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:32,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:32,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:32,944 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:32,944 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:32,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:32,944 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:32,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:32,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,970 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:32,970 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:32,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:32,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:32,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:33,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:31:33,104 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:33,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2022-12-06 07:31:33,104 INFO L420 AbstractCegarLoop]: === Iteration 648 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1746701643, now seen corresponding path program 1 times [2022-12-06 07:31:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882604191] [2022-12-06 07:31:33,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:33,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:31:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882604191] [2022-12-06 07:31:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882604191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104915194] [2022-12-06 07:31:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:33,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:33,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,437 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:33,437 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:33,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:33,450 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:33,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:33,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:33,451 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:33,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:33,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:33,487 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:33,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:33,487 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:33,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:33,487 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:33,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:33,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:33,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:33,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:33,512 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:33,512 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:31:33,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:33,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:33,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:33,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:33,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:33,652 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:33,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:33,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:33,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2022-12-06 07:31:33,652 INFO L420 AbstractCegarLoop]: === Iteration 649 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash -3891308, now seen corresponding path program 1 times [2022-12-06 07:31:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291246412] [2022-12-06 07:31:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:33,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:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291246412] [2022-12-06 07:31:33,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291246412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:33,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:33,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143796156] [2022-12-06 07:31:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:33,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:33,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:33,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:33,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:33,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:33,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:33,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:33,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:33,992 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:33,992 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:33,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:34,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:34,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:34,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:34,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:34,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:34,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,040 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:34,041 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:34,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,041 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,067 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:34,067 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:31:34,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:34,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:34,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:31:34,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:34,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2022-12-06 07:31:34,230 INFO L420 AbstractCegarLoop]: === Iteration 650 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1738919027, now seen corresponding path program 1 times [2022-12-06 07:31:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820879540] [2022-12-06 07:31:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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: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 [820879540] [2022-12-06 07:31:34,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820879540] 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 [4] imperfect sequences [] total 4 [2022-12-06 07:31:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018628088] [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,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:34,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:34,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:34,576 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:34,577 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:34,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:34,589 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:34,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:34,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:34,590 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:34,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:34,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:34,624 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:34,624 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:34,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:34,624 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:34,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:34,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,649 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:34,650 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:31:34,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:34,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:34,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:34,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:34,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:31:34,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:34,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:34,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:34,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2022-12-06 07:31:34,788 INFO L420 AbstractCegarLoop]: === Iteration 651 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -813237934, now seen corresponding path program 1 times [2022-12-06 07:31:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:34,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445283741] [2022-12-06 07:31:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:34,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:31:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445283741] [2022-12-06 07:31:34,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445283741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:34,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:34,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557629936] [2022-12-06 07:31:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:34,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:34,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:34,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:34,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:34,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:34,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,119 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:35,119 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:35,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:35,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:35,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:35,133 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:35,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:35,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,171 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:35,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:35,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,171 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,197 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:35,197 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:35,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:35,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:35,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:35,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2022-12-06 07:31:35,344 INFO L420 AbstractCegarLoop]: === Iteration 652 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash 929572401, now seen corresponding path program 1 times [2022-12-06 07:31:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421550790] [2022-12-06 07:31:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,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:31:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421550790] [2022-12-06 07:31:35,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421550790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388086164] [2022-12-06 07:31:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:35,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:35,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:35,686 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:35,686 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:35,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:35,699 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:35,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:35,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:35,700 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:35,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:35,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:35,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:35,735 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:35,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:35,735 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:35,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:35,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,761 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:35,761 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:31:35,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:35,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:35,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:35,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:35,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:31:35,899 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:35,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:35,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:35,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2022-12-06 07:31:35,899 INFO L420 AbstractCegarLoop]: === Iteration 653 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1622584560, now seen corresponding path program 1 times [2022-12-06 07:31:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:35,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865017358] [2022-12-06 07:31:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:35,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:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:35,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865017358] [2022-12-06 07:31:35,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865017358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:35,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:35,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494269044] [2022-12-06 07:31:35,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:35,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:35,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:35,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:35,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:35,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:35,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:35,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,237 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:36,237 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:36,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13514 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:36,251 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:36,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:36,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:36,252 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:36,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:36,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,286 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:36,286 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:36,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,286 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,311 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:36,312 INFO L131 PetriNetUnfolder]: For 3164/3307 co-relation queries the response was YES. [2022-12-06 07:31:36,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3164/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:36,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:36,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:36,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:31:36,470 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:36,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:36,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:36,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2022-12-06 07:31:36,470 INFO L420 AbstractCegarLoop]: === Iteration 654 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:36,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash 120225775, now seen corresponding path program 1 times [2022-12-06 07:31:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:36,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238469060] [2022-12-06 07:31:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:36,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:31:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238469060] [2022-12-06 07:31:36,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238469060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:36,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:36,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639430162] [2022-12-06 07:31:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:36,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:36,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:36,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:36,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:36,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:36,834 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:36,834 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:36,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:36,847 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:36,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:36,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:36,848 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:36,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:36,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:36,882 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:36,882 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:36,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:36,882 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:36,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:36,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,907 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:36,907 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:36,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:36,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:36,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:37,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:31:37,057 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:37,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2022-12-06 07:31:37,057 INFO L420 AbstractCegarLoop]: === Iteration 655 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1863036110, now seen corresponding path program 1 times [2022-12-06 07:31:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625107237] [2022-12-06 07:31:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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:37,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625107237] [2022-12-06 07:31:37,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625107237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698058757] [2022-12-06 07:31:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:37,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:37,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:37,380 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:37,380 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:37,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:37,393 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:37,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:37,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:37,394 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:37,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:37,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:37,428 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:37,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:37,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:37,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:37,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:37,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:37,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:37,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:37,463 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:37,463 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:31:37,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:37,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:37,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:37,610 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:37,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:31:37,610 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:37,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:37,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2022-12-06 07:31:37,611 INFO L420 AbstractCegarLoop]: === Iteration 656 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash -689120851, now seen corresponding path program 1 times [2022-12-06 07:31:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:37,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958015334] [2022-12-06 07:31:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:37,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:31:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:37,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958015334] [2022-12-06 07:31:37,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958015334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:37,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:37,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050916695] [2022-12-06 07:31:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:37,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:37,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:37,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:37,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:37,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:37,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:38,000 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:38,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:38,015 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:38,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:38,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:38,016 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:38,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:38,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:38,053 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:38,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,053 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,079 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:38,079 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:31:38,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:38,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:38,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:31:38,243 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:38,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2022-12-06 07:31:38,243 INFO L420 AbstractCegarLoop]: === Iteration 657 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1053689484, now seen corresponding path program 1 times [2022-12-06 07:31:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044335035] [2022-12-06 07:31:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:38,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:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044335035] [2022-12-06 07:31:38,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044335035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827996233] [2022-12-06 07:31:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:38,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:38,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:38,570 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:38,570 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:38,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:38,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:38,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:38,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:38,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:38,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:38,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:38,617 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:38,618 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:38,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:38,618 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:38,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:38,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,649 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:38,649 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:31:38,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:38,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:38,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:38,795 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:38,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:31:38,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:38,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:38,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2022-12-06 07:31:38,796 INFO L420 AbstractCegarLoop]: === Iteration 658 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1498467477, now seen corresponding path program 1 times [2022-12-06 07:31:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573192445] [2022-12-06 07:31:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:38,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:38,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:38,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573192445] [2022-12-06 07:31:38,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573192445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:38,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:38,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994836020] [2022-12-06 07:31:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:38,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:38,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:38,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:38,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:38,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:38,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:38,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,145 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:39,146 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:39,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:39,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:39,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:39,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:39,161 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:39,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:39,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,200 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:39,200 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:39,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,200 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,226 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:39,226 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:39,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:39,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:39,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:31:39,386 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:39,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2022-12-06 07:31:39,386 INFO L420 AbstractCegarLoop]: === Iteration 659 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash 244342858, now seen corresponding path program 1 times [2022-12-06 07:31:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903614106] [2022-12-06 07:31:39,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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:31:39,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903614106] [2022-12-06 07:31:39,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903614106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665760796] [2022-12-06 07:31:39,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:39,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:39,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:39,714 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:39,714 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:39,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:39,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:39,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:39,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:39,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:39,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:39,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:39,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:39,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:39,761 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:39,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:39,761 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:39,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:39,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,792 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:39,792 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:39,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:39,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:39,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:39,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:39,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:31:39,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:39,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:39,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:39,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2022-12-06 07:31:39,935 INFO L420 AbstractCegarLoop]: === Iteration 660 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:39,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1987153193, now seen corresponding path program 1 times [2022-12-06 07:31:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:39,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103693850] [2022-12-06 07:31:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:39,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:39,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:39,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103693850] [2022-12-06 07:31:39,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103693850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:39,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:39,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150293246] [2022-12-06 07:31:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:39,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:39,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:39,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:39,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:39,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:40,268 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:40,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:40,283 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:40,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:40,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:40,283 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:40,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:40,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,320 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:40,320 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:40,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,345 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:40,345 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:40,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:40,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:40,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:40,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:31:40,486 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:40,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:40,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:40,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2022-12-06 07:31:40,486 INFO L420 AbstractCegarLoop]: === Iteration 661 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -565003768, now seen corresponding path program 1 times [2022-12-06 07:31:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:40,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061946512] [2022-12-06 07:31:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:40,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:31:40,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061946512] [2022-12-06 07:31:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061946512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:40,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929569634] [2022-12-06 07:31:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:40,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:40,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:40,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:40,833 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:40,833 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:40,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:40,846 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:40,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:40,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:40,847 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:40,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:40,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:40,902 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:40,903 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:40,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:40,903 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:40,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:40,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,928 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:40,928 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:31:40,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:40,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:40,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:41,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:31:41,072 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:41,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2022-12-06 07:31:41,073 INFO L420 AbstractCegarLoop]: === Iteration 662 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1177806567, now seen corresponding path program 1 times [2022-12-06 07:31:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424699365] [2022-12-06 07:31:41,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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:31:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424699365] [2022-12-06 07:31:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424699365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882739844] [2022-12-06 07:31:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:41,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:41,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:41,410 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:41,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:41,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:41,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:41,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:41,425 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:41,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:41,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:41,459 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:41,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:41,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:41,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:41,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:41,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:41,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:41,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:41,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:41,485 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:41,485 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:31:41,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:41,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:41,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:41,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:41,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:31:41,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:41,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:41,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:41,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2022-12-06 07:31:41,623 INFO L420 AbstractCegarLoop]: === Iteration 663 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1374350394, now seen corresponding path program 1 times [2022-12-06 07:31:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:41,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558727000] [2022-12-06 07:31:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:41,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:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:41,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558727000] [2022-12-06 07:31:41,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558727000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:41,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:41,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311313205] [2022-12-06 07:31:41,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:41,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:41,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:41,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:41,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:41,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:41,986 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:41,987 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:41,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:41,997 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:41,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:41,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:41,998 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:41,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:42,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:42,031 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:42,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,031 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,057 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:42,057 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:42,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:42,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:42,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:31:42,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:42,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2022-12-06 07:31:42,202 INFO L420 AbstractCegarLoop]: === Iteration 664 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 368459941, now seen corresponding path program 1 times [2022-12-06 07:31:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667421111] [2022-12-06 07:31:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667421111] [2022-12-06 07:31:42,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667421111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441788828] [2022-12-06 07:31:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:42,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:42,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:42,537 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:42,537 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:42,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:42,552 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:42,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:42,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:42,553 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:42,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:42,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:42,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:42,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:42,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:42,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:42,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:42,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,616 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:42,617 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:42,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:42,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:42,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:42,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:42,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:31:42,765 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:42,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:42,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:42,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2022-12-06 07:31:42,765 INFO L420 AbstractCegarLoop]: === Iteration 665 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2111270276, now seen corresponding path program 1 times [2022-12-06 07:31:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:42,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411083087] [2022-12-06 07:31:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:42,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:42,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:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:42,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411083087] [2022-12-06 07:31:42,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411083087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:42,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:42,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434522288] [2022-12-06 07:31:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:42,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:42,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:42,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:42,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:42,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,114 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:43,115 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:43,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:43,126 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:43,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:43,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:43,127 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:43,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:43,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,156 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:43,156 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:43,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,156 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,181 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:43,181 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:31:43,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:43,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:43,322 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:31:43,323 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:43,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2022-12-06 07:31:43,323 INFO L420 AbstractCegarLoop]: === Iteration 666 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -440886685, now seen corresponding path program 1 times [2022-12-06 07:31:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132819839] [2022-12-06 07:31:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,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:31:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132819839] [2022-12-06 07:31:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132819839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893417956] [2022-12-06 07:31:43,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:43,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:43,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:43,653 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:43,653 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:43,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:43,667 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:43,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:43,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:43,668 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:43,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:43,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:43,703 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:43,703 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:43,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:43,704 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:43,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:43,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,729 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:43,729 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:43,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:43,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:43,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:43,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:43,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:31:43,869 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:43,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:43,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:43,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2022-12-06 07:31:43,870 INFO L420 AbstractCegarLoop]: === Iteration 667 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1301923650, now seen corresponding path program 1 times [2022-12-06 07:31:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:43,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595542940] [2022-12-06 07:31:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:43,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:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:43,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595542940] [2022-12-06 07:31:43,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595542940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:43,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:43,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833693445] [2022-12-06 07:31:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:43,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:43,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:43,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:43,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,212 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:44,213 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:44,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:44,225 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:44,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:44,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:44,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:44,226 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:44,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:44,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,256 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,256 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:44,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:44,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,282 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:44,282 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:44,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:44,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:44,424 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:31:44,425 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:44,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,425 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2022-12-06 07:31:44,426 INFO L420 AbstractCegarLoop]: === Iteration 668 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1250233311, now seen corresponding path program 1 times [2022-12-06 07:31:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116053211] [2022-12-06 07:31:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:44,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:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116053211] [2022-12-06 07:31:44,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116053211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:44,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:44,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894217574] [2022-12-06 07:31:44,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:44,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:44,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:44,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:44,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:44,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:44,753 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:44,753 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:44,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:44,767 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:44,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:44,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:44,768 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:44,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:44,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:44,801 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:44,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:44,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:44,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:44,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:44,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,827 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:44,827 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:31:44,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:44,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:44,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:44,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:44,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:31:44,973 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:44,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:44,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:44,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2022-12-06 07:31:44,973 INFO L420 AbstractCegarLoop]: === Iteration 669 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 492577024, now seen corresponding path program 1 times [2022-12-06 07:31:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:44,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738424229] [2022-12-06 07:31:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,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:31:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738424229] [2022-12-06 07:31:45,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738424229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741478067] [2022-12-06 07:31:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:45,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:45,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,319 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:45,319 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:45,331 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:45,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:45,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:45,332 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:45,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:45,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,365 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:45,365 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:45,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,365 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,393 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:45,393 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:31:45,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:45,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:45,535 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:45,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:31:45,535 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:45,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:45,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:45,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2022-12-06 07:31:45,536 INFO L420 AbstractCegarLoop]: === Iteration 670 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:45,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2059579937, now seen corresponding path program 1 times [2022-12-06 07:31:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:45,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781715038] [2022-12-06 07:31:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:45,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:31:45,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781715038] [2022-12-06 07:31:45,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781715038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:45,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914150315] [2022-12-06 07:31:45,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:45,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:45,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:45,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:45,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:45,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:45,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:45,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:45,879 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:45,879 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:45,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13502 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:45,893 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:45,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:45,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:45,894 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:45,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:45,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:45,930 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:45,930 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:45,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:45,930 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:45,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:45,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,955 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:45,955 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:45,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:45,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:45,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:46,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:31:46,101 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:46,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2022-12-06 07:31:46,101 INFO L420 AbstractCegarLoop]: === Iteration 671 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -316769602, now seen corresponding path program 1 times [2022-12-06 07:31:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338445058] [2022-12-06 07:31:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,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:31:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338445058] [2022-12-06 07:31:46,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338445058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920935658] [2022-12-06 07:31:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:46,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:46,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,442 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:46,442 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:46,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:46,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:46,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:46,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:46,455 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:46,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:46,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:46,486 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:46,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:46,487 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:46,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:46,487 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:46,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:46,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:46,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:46,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:46,512 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:46,512 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:31:46,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:46,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:46,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:46,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:46,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:31:46,650 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:46,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:46,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:46,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2022-12-06 07:31:46,650 INFO L420 AbstractCegarLoop]: === Iteration 672 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1426040733, now seen corresponding path program 1 times [2022-12-06 07:31:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608958752] [2022-12-06 07:31:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:46,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:31:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:46,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608958752] [2022-12-06 07:31:46,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608958752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:46,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:46,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106512416] [2022-12-06 07:31:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:46,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:46,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:46,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:46,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:46,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:46,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:46,971 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:46,971 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:46,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13557 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:46,984 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:46,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:46,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:46,985 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:46,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:47,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,020 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:47,020 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:47,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,020 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,045 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:47,045 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:47,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:47,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:47,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:31:47,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:47,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2022-12-06 07:31:47,201 INFO L420 AbstractCegarLoop]: === Iteration 673 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1126116228, now seen corresponding path program 1 times [2022-12-06 07:31:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574586677] [2022-12-06 07:31:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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:31:47,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574586677] [2022-12-06 07:31:47,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574586677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:47,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120946947] [2022-12-06 07:31:47,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:47,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:47,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:47,527 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:47,527 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:47,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:47,542 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:47,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:47,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:47,543 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:47,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:47,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:47,579 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:47,579 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:47,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:47,579 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:47,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:47,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:47,604 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:31:47,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:47,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:47,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:47,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:47,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:31:47,741 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:47,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:47,741 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:47,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2022-12-06 07:31:47,741 INFO L420 AbstractCegarLoop]: === Iteration 674 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 616694107, now seen corresponding path program 1 times [2022-12-06 07:31:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:47,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345117721] [2022-12-06 07:31:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:47,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:31:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:47,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345117721] [2022-12-06 07:31:47,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345117721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:47,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:47,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212214695] [2022-12-06 07:31:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:47,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:47,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:47,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:47,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:47,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,066 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:48,066 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:48,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:48,079 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:48,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:48,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:48,080 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:48,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:48,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,116 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:48,117 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:48,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,117 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,142 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:48,142 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:48,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:48,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:48,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:48,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:48,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2022-12-06 07:31:48,283 INFO L420 AbstractCegarLoop]: === Iteration 675 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1935462854, now seen corresponding path program 1 times [2022-12-06 07:31:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484768156] [2022-12-06 07:31:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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:31:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484768156] [2022-12-06 07:31:48,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484768156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459830415] [2022-12-06 07:31:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:48,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:48,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:48,615 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:48,615 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:48,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:48,630 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:48,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:48,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:48,631 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:48,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:48,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:48,665 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:48,665 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:48,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:48,666 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:48,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:48,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,691 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:48,691 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:31:48,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:48,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:48,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:48,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:48,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:31:48,847 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:48,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:48,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:48,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2022-12-06 07:31:48,847 INFO L420 AbstractCegarLoop]: === Iteration 676 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:48,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash -192652519, now seen corresponding path program 1 times [2022-12-06 07:31:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:48,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196069056] [2022-12-06 07:31:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:48,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:31:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196069056] [2022-12-06 07:31:48,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196069056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:48,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:48,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25397120] [2022-12-06 07:31:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:48,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:48,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:48,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:48,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,171 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:49,171 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:49,186 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:49,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:49,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:49,187 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:49,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:49,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:49,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:49,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,246 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:49,246 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:49,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:49,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:49,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:31:49,385 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:49,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2022-12-06 07:31:49,385 INFO L420 AbstractCegarLoop]: === Iteration 677 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1550157816, now seen corresponding path program 1 times [2022-12-06 07:31:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115415583] [2022-12-06 07:31:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:49,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:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115415583] [2022-12-06 07:31:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115415583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:49,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:49,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754449141] [2022-12-06 07:31:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:49,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:49,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:49,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:49,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:49,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:49,726 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:49,726 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:49,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:49,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:49,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:49,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:49,739 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:49,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:49,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:49,771 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,771 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:49,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:49,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:49,772 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,772 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:49,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:49,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,796 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:49,797 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:31:49,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:49,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:49,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:49,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:49,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:31:49,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:49,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:49,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:49,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2022-12-06 07:31:49,951 INFO L420 AbstractCegarLoop]: === Iteration 678 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1001999145, now seen corresponding path program 1 times [2022-12-06 07:31:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723906695] [2022-12-06 07:31:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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:31:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723906695] [2022-12-06 07:31:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723906695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:50,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231509712] [2022-12-06 07:31:50,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:50,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:50,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,264 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:50,264 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:50,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13592 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:50,277 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:50,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:50,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:50,278 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:50,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,312 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:50,312 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:50,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,312 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,337 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:50,337 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:31:50,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:50,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:50,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:50,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:31:50,486 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:50,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:50,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2022-12-06 07:31:50,486 INFO L420 AbstractCegarLoop]: === Iteration 679 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 740811190, now seen corresponding path program 1 times [2022-12-06 07:31:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001544421] [2022-12-06 07:31:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:50,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:31:50,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:50,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001544421] [2022-12-06 07:31:50,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001544421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:50,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:50,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805984957] [2022-12-06 07:31:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:50,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:50,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:50,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:50,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:50,811 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:50,811 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:50,824 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:50,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:50,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:50,824 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:50,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:50,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:50,859 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:50,860 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:50,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:50,860 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:50,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:50,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,885 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:50,885 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:50,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:50,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:50,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:51,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:31:51,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:51,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2022-12-06 07:31:51,023 INFO L420 AbstractCegarLoop]: === Iteration 680 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1811345771, now seen corresponding path program 1 times [2022-12-06 07:31:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938432447] [2022-12-06 07:31:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,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:31:51,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938432447] [2022-12-06 07:31:51,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938432447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:51,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226643677] [2022-12-06 07:31:51,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:51,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:51,354 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:51,371 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:51,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:51,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:51,372 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:51,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:51,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,407 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:51,407 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:51,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,407 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,432 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:51,432 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:51,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:51,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:51,578 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:51,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:31:51,579 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:51,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:51,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:51,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2022-12-06 07:31:51,579 INFO L420 AbstractCegarLoop]: === Iteration 681 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash -68535436, now seen corresponding path program 1 times [2022-12-06 07:31:51,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:51,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819015358] [2022-12-06 07:31:51,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:51,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819015358] [2022-12-06 07:31:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819015358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:51,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:51,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77842583] [2022-12-06 07:31:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:51,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:51,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:51,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:51,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:51,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:51,923 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:51,923 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:51,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:51,937 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:51,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:51,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:51,938 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:51,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:51,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:51,972 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:51,972 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:51,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:51,972 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,972 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:51,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:51,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:51,997 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:51,997 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:31:51,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:52,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:52,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:52,137 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:31:52,138 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2022-12-06 07:31:52,138 INFO L420 AbstractCegarLoop]: === Iteration 682 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1674274899, now seen corresponding path program 1 times [2022-12-06 07:31:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508212005] [2022-12-06 07:31:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:52,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:31:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508212005] [2022-12-06 07:31:52,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508212005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378243436] [2022-12-06 07:31:52,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:52,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:52,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:52,460 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:52,460 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:52,474 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:52,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:52,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:52,474 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:52,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:52,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:52,511 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:52,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:52,511 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:52,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:52,511 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:52,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:52,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:52,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:52,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:52,544 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:52,544 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:31:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:52,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:52,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:52,695 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:52,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:31:52,695 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:52,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:52,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:52,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2022-12-06 07:31:52,696 INFO L420 AbstractCegarLoop]: === Iteration 683 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash -877882062, now seen corresponding path program 1 times [2022-12-06 07:31:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:52,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420809338] [2022-12-06 07:31:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:52,696 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,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:31:52,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:52,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420809338] [2022-12-06 07:31:52,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420809338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:52,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:52,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821331169] [2022-12-06 07:31:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:52,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:52,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:52,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:52,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:52,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:52,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:52,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,013 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:53,014 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:31:53,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13531 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:53,029 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:53,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:53,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:53,030 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:53,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:53,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,065 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:53,065 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:53,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,065 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,090 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:53,091 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:31:53,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:53,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:53,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:31:53,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:53,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2022-12-06 07:31:53,236 INFO L420 AbstractCegarLoop]: === Iteration 684 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 864928273, now seen corresponding path program 1 times [2022-12-06 07:31:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156140296] [2022-12-06 07:31:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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:31:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156140296] [2022-12-06 07:31:53,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156140296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288459002] [2022-12-06 07:31:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:53,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:53,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:53,600 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:53,601 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:31:53,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:53,618 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:53,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:53,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:53,619 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:53,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:53,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:53,658 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:53,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:53,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:53,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:53,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:53,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,683 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:53,683 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:31:53,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:53,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:53,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:53,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:53,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:31:53,832 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:53,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:53,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:53,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2022-12-06 07:31:53,833 INFO L420 AbstractCegarLoop]: === Iteration 685 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1687228688, now seen corresponding path program 1 times [2022-12-06 07:31:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:53,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303549559] [2022-12-06 07:31:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:53,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:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:53,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303549559] [2022-12-06 07:31:53,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303549559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:53,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:53,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076354687] [2022-12-06 07:31:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:53,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:53,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:53,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:53,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:53,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,184 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:54,184 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:31:54,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:54,199 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:54,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:54,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:54,200 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:54,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:54,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,254 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:54,254 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:54,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,295 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:54,295 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:31:54,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:54,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:54,453 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 07:31:54,454 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:54,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2022-12-06 07:31:54,454 INFO L420 AbstractCegarLoop]: === Iteration 686 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 55581647, now seen corresponding path program 1 times [2022-12-06 07:31:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084953114] [2022-12-06 07:31:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:54,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:31:54,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:54,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084953114] [2022-12-06 07:31:54,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084953114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:54,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:54,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483071724] [2022-12-06 07:31:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:54,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:54,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:54,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:54,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:54,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:54,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:54,776 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:54,776 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:54,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:54,789 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:54,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:54,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:54,789 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:54,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:54,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:54,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:54,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:54,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:54,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:54,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,848 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:54,848 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:54,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:54,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:54,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:54,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:54,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:31:54,986 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:54,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:54,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2022-12-06 07:31:54,987 INFO L420 AbstractCegarLoop]: === Iteration 687 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1798391982, now seen corresponding path program 1 times [2022-12-06 07:31:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:54,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902341060] [2022-12-06 07:31:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:55,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:31:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902341060] [2022-12-06 07:31:55,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902341060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780185604] [2022-12-06 07:31:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:55,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,305 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:55,305 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:55,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:55,318 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:55,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:55,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:55,319 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:55,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:55,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:55,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:55,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,379 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:55,380 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:31:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:55,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:55,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:55,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:31:55,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:55,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:55,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:55,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2022-12-06 07:31:55,523 INFO L420 AbstractCegarLoop]: === Iteration 688 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -753764979, now seen corresponding path program 1 times [2022-12-06 07:31:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:55,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72282767] [2022-12-06 07:31:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:55,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:31:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72282767] [2022-12-06 07:31:55,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72282767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:55,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:55,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394873384] [2022-12-06 07:31:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:55,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:55,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:55,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:55,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:55,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:55,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:55,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:55,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:55,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:55,874 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:55,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:55,890 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:55,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:55,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:55,891 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:55,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:55,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:55,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:55,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:55,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:55,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:55,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:55,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:55,953 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:31:55,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:55,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:55,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:56,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:56,093 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:56,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2022-12-06 07:31:56,093 INFO L420 AbstractCegarLoop]: === Iteration 689 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 989045356, now seen corresponding path program 1 times [2022-12-06 07:31:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329940577] [2022-12-06 07:31:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,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:31:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329940577] [2022-12-06 07:31:56,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329940577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750281135] [2022-12-06 07:31:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:56,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,416 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:56,416 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:56,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:56,429 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:56,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:56,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:56,430 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:56,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:56,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:56,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:56,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:56,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:56,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:56,464 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:56,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:56,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:56,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:56,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:56,489 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:56,489 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:31:56,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:56,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:56,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:56,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:56,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:31:56,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:56,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:56,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:56,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2022-12-06 07:31:56,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 (and 1 more)] === [2022-12-06 07:31:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1563111605, now seen corresponding path program 1 times [2022-12-06 07:31:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:56,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861991000] [2022-12-06 07:31:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:31:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:56,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861991000] [2022-12-06 07:31:56,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861991000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:56,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:56,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267426037] [2022-12-06 07:31:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:56,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:56,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:56,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:56,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:56,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:56,988 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:56,988 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:56,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:57,002 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:57,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:57,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:57,002 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:57,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:57,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,040 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:57,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:57,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,040 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,066 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:57,066 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:57,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:57,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:57,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:31:57,205 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:57,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2022-12-06 07:31:57,205 INFO L420 AbstractCegarLoop]: === Iteration 691 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash 179698730, now seen corresponding path program 1 times [2022-12-06 07:31:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471010166] [2022-12-06 07:31:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:57,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:57,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471010166] [2022-12-06 07:31:57,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471010166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066402638] [2022-12-06 07:31:57,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:57,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:57,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:57,538 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:57,539 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:31:57,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:57,551 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:57,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:57,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:57,552 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:57,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:57,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:57,585 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:57,586 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:57,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:57,586 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:57,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:57,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,611 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:57,611 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:57,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:57,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:57,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:57,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:57,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:31:57,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:57,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:57,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2022-12-06 07:31:57,743 INFO L420 AbstractCegarLoop]: === Iteration 692 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1922509065, now seen corresponding path program 1 times [2022-12-06 07:31:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:57,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600688515] [2022-12-06 07:31:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:57,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:31:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:57,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600688515] [2022-12-06 07:31:57,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600688515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:57,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:57,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788366138] [2022-12-06 07:31:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:57,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:57,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:57,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:57,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,061 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:58,061 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:31:58,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:58,075 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:58,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:58,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:58,076 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:58,076 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:58,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:58,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,110 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:58,110 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:58,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,110 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,135 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:58,135 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:31:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3010 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:58,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:58,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:31:58,289 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:58,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2022-12-06 07:31:58,289 INFO L420 AbstractCegarLoop]: === Iteration 693 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash -629647896, now seen corresponding path program 1 times [2022-12-06 07:31:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896653665] [2022-12-06 07:31:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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:31:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896653665] [2022-12-06 07:31:58,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896653665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:58,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833942904] [2022-12-06 07:31:58,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:58,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:58,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:58,665 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:58,665 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:31:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:58,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:58,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:58,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:58,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:58,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:58,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:58,716 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:58,716 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:58,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:58,716 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:58,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:58,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,741 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:31:58,741 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:31:58,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:31:58,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:58,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:58,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:58,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:31:58,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:58,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:58,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:58,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2022-12-06 07:31:58,883 INFO L420 AbstractCegarLoop]: === Iteration 694 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1113162439, now seen corresponding path program 1 times [2022-12-06 07:31:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:58,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033429738] [2022-12-06 07:31:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:58,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:31:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:58,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033429738] [2022-12-06 07:31:58,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033429738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:58,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:58,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101953676] [2022-12-06 07:31:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:58,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:58,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:58,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:58,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:58,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,218 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:59,219 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:31:59,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:59,231 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:59,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:59,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:59,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:59,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:59,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,267 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:59,267 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:59,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,267 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,292 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:59,292 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:31:59,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:59,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:59,437 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:31:59,438 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:59,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2022-12-06 07:31:59,438 INFO L420 AbstractCegarLoop]: === Iteration 695 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1438994522, now seen corresponding path program 1 times [2022-12-06 07:31:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046977067] [2022-12-06 07:31:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:31:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:31:59,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:31:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:31:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046977067] [2022-12-06 07:31:59,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046977067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:31:59,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:31:59,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:31:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654206911] [2022-12-06 07:31:59,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:31:59,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:31:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:31:59,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:31:59,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:31:59,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:31:59,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:31:59,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:31:59,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:31:59,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:31:59,764 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:31:59,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13510 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:31:59,776 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:31:59,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:31:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:31:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:31:59,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:31:59,777 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:31:59,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:31:59,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:31:59,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:31:59,812 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:31:59,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:31:59,812 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:31:59,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:31:59,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,838 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:31:59,838 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:31:59,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:31:59,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:31:59,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:31:59,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:31:59,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:31:59,987 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:31:59,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:31:59,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:31:59,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2022-12-06 07:31:59,987 INFO L420 AbstractCegarLoop]: === Iteration 696 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:31:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:31:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 303815813, now seen corresponding path program 1 times [2022-12-06 07:31:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:31:59,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733821922] [2022-12-06 07:31:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:31:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733821922] [2022-12-06 07:32:00,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733821922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:00,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420511035] [2022-12-06 07:32:00,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:00,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:00,327 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:00,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:00,341 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:00,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:00,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:00,342 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:00,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:00,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:00,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,406 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:00,406 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:00,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:00,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:00,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:00,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:32:00,566 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:00,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:00,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:00,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2022-12-06 07:32:00,566 INFO L420 AbstractCegarLoop]: === Iteration 697 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2046626148, now seen corresponding path program 1 times [2022-12-06 07:32:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:00,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82605589] [2022-12-06 07:32:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:00,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:32:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:00,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82605589] [2022-12-06 07:32:00,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82605589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:00,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:00,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105547009] [2022-12-06 07:32:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:00,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:00,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:00,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:00,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:00,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:00,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:00,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:00,924 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:00,924 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:00,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:00,937 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:00,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:00,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:00,938 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:00,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:00,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:00,972 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:00,972 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:00,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:00,972 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:00,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:00,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:00,997 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:00,997 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:00,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:01,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:01,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:01,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,137 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:01,137 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:01,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2022-12-06 07:32:01,137 INFO L420 AbstractCegarLoop]: === Iteration 698 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -505530813, now seen corresponding path program 1 times [2022-12-06 07:32:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390662429] [2022-12-06 07:32:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390662429] [2022-12-06 07:32:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390662429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862335089] [2022-12-06 07:32:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:01,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:01,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:01,457 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:01,457 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:01,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:01,470 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:01,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:01,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:01,471 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:01,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:01,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:01,505 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:01,505 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:01,505 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:01,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:01,505 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:01,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:01,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:01,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:01,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:01,537 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:01,537 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:32:01,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:01,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:01,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:01,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:01,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:32:01,689 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:01,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:01,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:01,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2022-12-06 07:32:01,689 INFO L420 AbstractCegarLoop]: === Iteration 699 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1237279522, now seen corresponding path program 1 times [2022-12-06 07:32:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:01,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406862216] [2022-12-06 07:32:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:01,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:32:01,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:01,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406862216] [2022-12-06 07:32:01,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406862216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:01,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:01,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914868113] [2022-12-06 07:32:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:01,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:01,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:01,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:01,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:01,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:01,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,008 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:02,008 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:02,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:02,021 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:02,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:02,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:02,022 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:02,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:02,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,056 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:02,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:02,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,056 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,081 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:02,081 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:02,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:02,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:02,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:32:02,232 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:02,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2022-12-06 07:32:02,232 INFO L420 AbstractCegarLoop]: === Iteration 700 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1314877439, now seen corresponding path program 1 times [2022-12-06 07:32:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627354145] [2022-12-06 07:32:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,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:32:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627354145] [2022-12-06 07:32:02,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627354145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335023415] [2022-12-06 07:32:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:02,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:02,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:02,566 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:02,566 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:02,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:02,579 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:02,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:02,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:02,579 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:02,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:02,615 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:02,615 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:02,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:02,615 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:02,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:02,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,647 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:02,647 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:32:02,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:02,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:02,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:02,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:02,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:32:02,791 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:02,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:02,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:02,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2022-12-06 07:32:02,791 INFO L420 AbstractCegarLoop]: === Iteration 701 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 427932896, now seen corresponding path program 1 times [2022-12-06 07:32:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:02,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954470526] [2022-12-06 07:32:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:02,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:32:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954470526] [2022-12-06 07:32:02,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954470526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:02,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:02,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500777642] [2022-12-06 07:32:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:02,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:02,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:02,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:02,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:02,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,113 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:03,113 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:32:03,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:03,127 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:03,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:03,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:03,128 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:03,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:03,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,161 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:03,162 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:03,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,162 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,187 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:03,187 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:32:03,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:03,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:03,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:32:03,333 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:03,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2022-12-06 07:32:03,334 INFO L420 AbstractCegarLoop]: === Iteration 702 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2124224065, now seen corresponding path program 1 times [2022-12-06 07:32:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275715488] [2022-12-06 07:32:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:03,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:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275715488] [2022-12-06 07:32:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275715488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:03,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063951451] [2022-12-06 07:32:03,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:03,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:03,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:03,686 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:03,686 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:03,700 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:03,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:03,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:03,700 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:03,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:03,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:03,754 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:03,755 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:03,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:03,755 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:03,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:03,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,779 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:03,780 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:32:03,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:03,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:03,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:03,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:03,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:32:03,930 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:03,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:03,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:03,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2022-12-06 07:32:03,930 INFO L420 AbstractCegarLoop]: === Iteration 703 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:03,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:03,930 INFO L85 PathProgramCache]: Analyzing trace with hash -381413730, now seen corresponding path program 1 times [2022-12-06 07:32:03,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:03,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057151486] [2022-12-06 07:32:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:03,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:32:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:03,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057151486] [2022-12-06 07:32:03,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057151486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:03,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:03,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564170975] [2022-12-06 07:32:03,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:03,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:03,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:03,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:03,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:04,275 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:04,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:04,288 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:04,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:04,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:04,289 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:04,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:04,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:04,323 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:04,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:04,348 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:04,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:04,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:04,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:04,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:32:04,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:04,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:04,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:04,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2022-12-06 07:32:04,502 INFO L420 AbstractCegarLoop]: === Iteration 704 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1361396605, now seen corresponding path program 1 times [2022-12-06 07:32:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:04,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792811705] [2022-12-06 07:32:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:04,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:04,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792811705] [2022-12-06 07:32:04,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792811705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:04,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:04,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732911034] [2022-12-06 07:32:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:04,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:04,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:04,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:04,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:04,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:04,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:04,858 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:04,859 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:04,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:04,869 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:04,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:04,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:04,870 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:04,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:04,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:04,900 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:04,900 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:04,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:04,900 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:04,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:04,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,928 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:04,928 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:04,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:04,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:04,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:05,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:32:05,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:05,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2022-12-06 07:32:05,085 INFO L420 AbstractCegarLoop]: === Iteration 705 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1190760356, now seen corresponding path program 1 times [2022-12-06 07:32:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130736011] [2022-12-06 07:32:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130736011] [2022-12-06 07:32:05,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130736011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031583148] [2022-12-06 07:32:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:05,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,419 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:05,419 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:05,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:05,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:05,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:05,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:05,432 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:05,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:05,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:05,466 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:05,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:05,466 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:05,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:05,466 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:05,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:05,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:05,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:05,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:05,491 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:05,491 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:32:05,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:05,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:05,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:05,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:05,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:32:05,650 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:05,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:05,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:05,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2022-12-06 07:32:05,650 INFO L420 AbstractCegarLoop]: === Iteration 706 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash 552049979, now seen corresponding path program 1 times [2022-12-06 07:32:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:05,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763275237] [2022-12-06 07:32:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:05,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:32:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:05,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763275237] [2022-12-06 07:32:05,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763275237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:05,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:05,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:05,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410196373] [2022-12-06 07:32:05,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:05,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:05,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:05,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:05,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:05,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:05,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:05,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:05,999 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:06,000 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:32:06,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:06,011 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:06,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:06,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:06,011 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:06,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:06,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:06,042 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:06,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,042 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,067 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:06,067 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:06,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:06,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:06,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:32:06,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:06,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2022-12-06 07:32:06,218 INFO L420 AbstractCegarLoop]: === Iteration 707 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2000106982, now seen corresponding path program 1 times [2022-12-06 07:32:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093927478] [2022-12-06 07:32:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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:32:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093927478] [2022-12-06 07:32:06,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093927478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160414445] [2022-12-06 07:32:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:06,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:06,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:06,542 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:06,542 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:32:06,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:06,556 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:06,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:06,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:06,556 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:06,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:06,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:06,592 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:06,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:06,592 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:06,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:06,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,617 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:06,617 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:32:06,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:06,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:06,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:06,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:06,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:32:06,763 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:06,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:06,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:06,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2022-12-06 07:32:06,763 INFO L420 AbstractCegarLoop]: === Iteration 708 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash -257296647, now seen corresponding path program 1 times [2022-12-06 07:32:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:06,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841353847] [2022-12-06 07:32:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:06,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:32:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:06,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841353847] [2022-12-06 07:32:06,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841353847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:06,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:06,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492441678] [2022-12-06 07:32:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:06,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:06,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:06,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:06,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:06,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:06,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,157 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:07,158 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:07,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:07,172 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:07,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:07,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:07,173 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:07,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:07,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,204 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,204 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:07,204 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:07,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,204 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,229 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:07,229 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:32:07,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:07,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:07,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:07,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:32:07,388 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:07,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2022-12-06 07:32:07,389 INFO L420 AbstractCegarLoop]: === Iteration 709 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:07,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:07,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1485513688, now seen corresponding path program 1 times [2022-12-06 07:32:07,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:07,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107258781] [2022-12-06 07:32:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:07,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:32:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:07,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107258781] [2022-12-06 07:32:07,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107258781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:07,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:07,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297152551] [2022-12-06 07:32:07,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:07,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:07,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:07,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:07,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:07,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:07,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:07,796 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:07,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:07,808 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:07,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:07,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:07,808 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:07,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:07,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:07,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:07,843 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:07,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:07,843 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:07,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:07,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,868 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:07,868 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:07,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:07,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:07,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:08,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:32:08,002 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:08,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2022-12-06 07:32:08,003 INFO L420 AbstractCegarLoop]: === Iteration 710 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1066643273, now seen corresponding path program 1 times [2022-12-06 07:32:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343027109] [2022-12-06 07:32:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:08,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343027109] [2022-12-06 07:32:08,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343027109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611877944] [2022-12-06 07:32:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:08,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:08,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,319 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:08,320 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:08,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:08,331 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:08,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:08,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:08,331 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:08,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:08,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,365 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:08,365 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:08,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,365 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,395 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:08,395 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:32:08,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:08,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:08,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:08,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 07:32:08,565 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:08,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:08,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:08,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2022-12-06 07:32:08,565 INFO L420 AbstractCegarLoop]: === Iteration 711 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 676167062, now seen corresponding path program 1 times [2022-12-06 07:32:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:08,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708014627] [2022-12-06 07:32:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:08,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:32:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708014627] [2022-12-06 07:32:08,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708014627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:08,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:08,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198367107] [2022-12-06 07:32:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:08,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:08,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:08,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:08,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:08,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:08,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:08,898 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:08,899 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:08,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:08,911 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:08,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:08,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:08,912 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:08,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:08,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:08,945 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:08,945 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:08,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:08,945 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:08,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:08,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,971 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:08,971 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:08,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:08,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:08,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:09,133 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:32:09,133 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:09,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2022-12-06 07:32:09,134 INFO L420 AbstractCegarLoop]: === Iteration 712 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1875989899, now seen corresponding path program 1 times [2022-12-06 07:32:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589755856] [2022-12-06 07:32:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,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:32:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589755856] [2022-12-06 07:32:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589755856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731914229] [2022-12-06 07:32:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:09,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:09,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:09,536 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:09,537 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:09,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:09,549 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:09,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:09,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:09,550 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:09,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:09,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:09,583 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:09,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:09,583 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:09,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:09,584 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:09,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:09,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:09,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:09,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:09,609 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:09,609 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:32:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2999 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:09,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:09,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:09,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:09,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:32:09,766 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:09,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:09,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:09,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2022-12-06 07:32:09,766 INFO L420 AbstractCegarLoop]: === Iteration 713 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -133179564, now seen corresponding path program 1 times [2022-12-06 07:32:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:09,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024539795] [2022-12-06 07:32:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:09,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:32:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024539795] [2022-12-06 07:32:09,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024539795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:09,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:09,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029573519] [2022-12-06 07:32:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:09,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:09,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:09,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:09,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,110 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:10,111 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:10,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:10,125 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:10,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:10,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:10,126 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:10,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:10,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,160 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,160 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:10,160 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:10,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,160 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,186 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:10,186 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:32:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:10,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:10,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:32:10,324 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:10,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2022-12-06 07:32:10,324 INFO L420 AbstractCegarLoop]: === Iteration 714 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:10,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1609630771, now seen corresponding path program 1 times [2022-12-06 07:32:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441032731] [2022-12-06 07:32:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441032731] [2022-12-06 07:32:10,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441032731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513875194] [2022-12-06 07:32:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:10,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:10,649 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:10,649 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:10,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:10,662 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:10,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:10,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:10,663 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:10,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:10,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:10,698 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:10,698 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:10,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:10,698 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:10,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,723 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:10,723 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:32:10,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:10,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:10,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:10,859 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:10,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:32:10,860 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:10,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:10,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:10,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2022-12-06 07:32:10,860 INFO L420 AbstractCegarLoop]: === Iteration 715 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash -942526190, now seen corresponding path program 1 times [2022-12-06 07:32:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:10,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987206251] [2022-12-06 07:32:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:10,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:32:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:10,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987206251] [2022-12-06 07:32:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987206251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:10,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379822984] [2022-12-06 07:32:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:10,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:10,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:10,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:10,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:10,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,193 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:11,193 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:11,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:11,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:11,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:11,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:11,206 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:11,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:11,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,238 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,238 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:11,238 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:11,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,239 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,263 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:11,263 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:11,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:11,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:11,402 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:11,403 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:11,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2022-12-06 07:32:11,403 INFO L420 AbstractCegarLoop]: === Iteration 716 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 800284145, now seen corresponding path program 1 times [2022-12-06 07:32:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719653599] [2022-12-06 07:32:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:11,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:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:11,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719653599] [2022-12-06 07:32:11,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719653599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:11,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:11,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258243876] [2022-12-06 07:32:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:11,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:11,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:11,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:11,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:11,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:11,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:11,739 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:11,739 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:11,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:11,751 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:11,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:11,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:11,752 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:11,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:11,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:11,787 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:11,787 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:11,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:11,787 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:11,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:11,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,812 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:11,813 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:11,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:11,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:11,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:11,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:11,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:32:11,954 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:11,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:11,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2022-12-06 07:32:11,955 INFO L420 AbstractCegarLoop]: === Iteration 717 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1751872816, now seen corresponding path program 1 times [2022-12-06 07:32:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:11,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375961327] [2022-12-06 07:32:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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:12,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375961327] [2022-12-06 07:32:12,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375961327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18842369] [2022-12-06 07:32:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:12,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:12,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,278 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:12,278 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:12,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13589 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:12,290 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:12,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:12,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:12,291 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:12,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:12,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,324 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:12,324 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:12,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,324 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,349 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:12,349 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:32:12,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:12,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:12,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:12,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:32:12,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:12,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:12,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:12,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2022-12-06 07:32:12,497 INFO L420 AbstractCegarLoop]: === Iteration 718 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -9062481, now seen corresponding path program 1 times [2022-12-06 07:32:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:12,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460113989] [2022-12-06 07:32:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:12,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:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:12,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460113989] [2022-12-06 07:32:12,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460113989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:12,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:12,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113330065] [2022-12-06 07:32:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:12,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:12,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:12,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:12,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:12,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:12,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:12,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:12,844 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:12,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:12,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:12,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:12,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:12,857 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:12,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:12,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:12,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:12,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:12,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:12,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:12,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:12,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,918 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:12,918 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:12,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:12,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:12,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:13,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:32:13,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:13,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2022-12-06 07:32:13,063 INFO L420 AbstractCegarLoop]: === Iteration 719 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:13,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1733747854, now seen corresponding path program 1 times [2022-12-06 07:32:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288141921] [2022-12-06 07:32:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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:32:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288141921] [2022-12-06 07:32:13,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288141921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959143617] [2022-12-06 07:32:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:13,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:13,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,387 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:13,388 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:13,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:13,400 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:13,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:13,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:13,401 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:13,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:13,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:13,439 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:13,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,439 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,464 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:13,464 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:32:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:13,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:13,616 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:13,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:32:13,617 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:13,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:13,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:13,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2022-12-06 07:32:13,617 INFO L420 AbstractCegarLoop]: === Iteration 720 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash -818409107, now seen corresponding path program 1 times [2022-12-06 07:32:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:13,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425975812] [2022-12-06 07:32:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:13,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:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:13,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425975812] [2022-12-06 07:32:13,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425975812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:13,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:13,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:13,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024593342] [2022-12-06 07:32:13,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:13,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:13,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:13,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:13,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:13,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:13,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:13,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:13,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:13,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:13,948 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:32:13,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:13,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:13,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:13,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:13,960 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:13,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:13,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:13,992 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:13,993 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:13,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:13,993 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:13,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:13,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,017 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:14,017 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:32:14,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:14,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:14,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:14,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:14,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2022-12-06 07:32:14,158 INFO L420 AbstractCegarLoop]: === Iteration 721 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,158 INFO L85 PathProgramCache]: Analyzing trace with hash 924401228, now seen corresponding path program 1 times [2022-12-06 07:32:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929690223] [2022-12-06 07:32:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929690223] [2022-12-06 07:32:14,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929690223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053058617] [2022-12-06 07:32:14,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:14,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:14,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:14,482 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:14,482 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:14,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13551 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:14,494 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:14,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:14,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:14,495 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:14,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:14,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:14,529 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:14,529 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:14,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:14,529 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:14,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:14,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,553 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:14,554 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:32:14,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:14,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:14,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:14,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:14,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:32:14,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:14,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:14,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:14,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2022-12-06 07:32:14,710 INFO L420 AbstractCegarLoop]: === Iteration 722 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1627755733, now seen corresponding path program 1 times [2022-12-06 07:32:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:14,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609198233] [2022-12-06 07:32:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:14,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:32:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:14,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609198233] [2022-12-06 07:32:14,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609198233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:14,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:14,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695018125] [2022-12-06 07:32:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:14,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:14,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:14,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:14,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,030 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:15,031 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:15,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13538 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:15,043 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:15,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:15,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:15,044 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:15,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:15,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,076 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:15,076 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:15,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,076 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,100 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:15,101 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:32:15,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:15,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:15,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:32:15,249 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:15,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2022-12-06 07:32:15,250 INFO L420 AbstractCegarLoop]: === Iteration 723 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash 115054602, now seen corresponding path program 1 times [2022-12-06 07:32:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985003558] [2022-12-06 07:32:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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:15,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985003558] [2022-12-06 07:32:15,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985003558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346251922] [2022-12-06 07:32:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:15,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:15,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:15,571 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:15,571 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:15,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:15,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:15,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:15,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:15,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:15,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:15,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:15,617 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:15,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:15,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:15,617 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:15,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:15,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,642 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:15,642 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:15,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:15,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:15,784 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:15,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:32:15,784 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:15,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:15,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:15,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2022-12-06 07:32:15,784 INFO L420 AbstractCegarLoop]: === Iteration 724 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1857864937, now seen corresponding path program 1 times [2022-12-06 07:32:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:15,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832346940] [2022-12-06 07:32:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:15,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:32:15,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:15,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832346940] [2022-12-06 07:32:15,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832346940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:15,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:15,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974288605] [2022-12-06 07:32:15,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:15,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:15,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:15,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:15,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:15,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,131 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:16,132 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:16,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:16,146 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:16,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:16,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:16,147 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:16,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:16,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:16,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,183 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,208 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:16,209 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:32:16,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:16,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:16,356 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:32:16,357 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:16,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2022-12-06 07:32:16,357 INFO L420 AbstractCegarLoop]: === Iteration 725 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash -694292024, now seen corresponding path program 1 times [2022-12-06 07:32:16,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650887549] [2022-12-06 07:32:16,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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:32:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650887549] [2022-12-06 07:32:16,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650887549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891372708] [2022-12-06 07:32:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:16,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:16,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:16,671 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:16,671 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:16,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:16,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:16,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:16,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:16,684 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:16,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:16,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:16,718 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:16,718 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:16,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:16,718 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:16,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:16,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,743 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:16,744 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:32:16,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:16,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:16,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:16,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:16,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:32:16,893 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:16,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:16,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:16,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2022-12-06 07:32:16,893 INFO L420 AbstractCegarLoop]: === Iteration 726 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1048518311, now seen corresponding path program 1 times [2022-12-06 07:32:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:16,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377502675] [2022-12-06 07:32:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:16,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:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:16,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377502675] [2022-12-06 07:32:16,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377502675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:16,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:16,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910010645] [2022-12-06 07:32:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:16,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:16,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:16,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:16,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:16,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,230 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:17,231 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:17,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:17,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:17,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:17,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:17,244 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:17,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:17,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,277 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:17,278 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:17,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,278 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,278 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,278 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,303 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:17,303 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:32:17,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:17,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:17,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:17,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:32:17,449 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:17,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:17,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:17,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2022-12-06 07:32:17,449 INFO L420 AbstractCegarLoop]: === Iteration 727 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1503638650, now seen corresponding path program 1 times [2022-12-06 07:32:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:17,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072213965] [2022-12-06 07:32:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:17,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:32:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072213965] [2022-12-06 07:32:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072213965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:17,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:17,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974381646] [2022-12-06 07:32:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:17,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:17,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:17,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:17,774 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:17,774 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:17,787 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:17,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:17,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:17,787 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:17,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:17,822 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:17,822 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:17,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:17,822 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:17,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:17,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,847 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:17,848 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:32:17,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:17,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:17,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:18,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 07:32:18,017 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:18,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2022-12-06 07:32:18,017 INFO L420 AbstractCegarLoop]: === Iteration 728 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 239171685, now seen corresponding path program 1 times [2022-12-06 07:32:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:18,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809381460] [2022-12-06 07:32:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:18,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:32:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809381460] [2022-12-06 07:32:18,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809381460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:18,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048699293] [2022-12-06 07:32:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:18,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:18,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,340 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:18,340 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:18,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13587 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:18,353 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:18,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:18,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:18,354 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:18,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:18,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,389 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:18,389 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:18,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,389 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,415 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:18,415 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:18,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:18,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:18,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:18,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:32:18,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:18,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:18,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:18,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2022-12-06 07:32:18,557 INFO L420 AbstractCegarLoop]: === Iteration 729 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1981982020, 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 [1534062380] [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,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534062380] [2022-12-06 07:32:18,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534062380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:18,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:18,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495586786] [2022-12-06 07:32:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:18,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:18,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:18,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:18,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:18,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:18,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:18,896 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:18,896 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:18,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:18,909 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:18,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:18,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:18,910 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:18,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:18,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:18,942 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:18,942 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:18,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:18,942 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:18,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:18,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,976 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:18,976 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:32:18,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:18,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:18,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:19,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:32:19,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:19,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2022-12-06 07:32:19,122 INFO L420 AbstractCegarLoop]: === Iteration 730 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash -570174941, now seen corresponding path program 1 times [2022-12-06 07:32:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477613584] [2022-12-06 07:32:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:19,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:32:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477613584] [2022-12-06 07:32:19,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477613584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611653126] [2022-12-06 07:32:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:19,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:19,452 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:19,452 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:19,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:19,465 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:19,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:19,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:19,466 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:19,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:19,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:19,500 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:19,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:19,501 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:19,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:19,501 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:19,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:19,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:19,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:19,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:19,526 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:19,526 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:32:19,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:19,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:19,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:19,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:19,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:32:19,674 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:19,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:19,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:19,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2022-12-06 07:32:19,675 INFO L420 AbstractCegarLoop]: === Iteration 731 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1172635394, now seen corresponding path program 1 times [2022-12-06 07:32:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:19,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44692437] [2022-12-06 07:32:19,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:19,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44692437] [2022-12-06 07:32:19,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44692437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:19,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:19,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002533121] [2022-12-06 07:32:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:19,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:19,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:19,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:19,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:19,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,018 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:20,018 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:20,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:20,031 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:20,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:20,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:20,032 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:20,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:20,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,064 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:20,064 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:20,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,064 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,096 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:20,096 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:32:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:20,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:20,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:32:20,231 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:20,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2022-12-06 07:32:20,232 INFO L420 AbstractCegarLoop]: === Iteration 732 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1379521567, now seen corresponding path program 1 times [2022-12-06 07:32:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456859065] [2022-12-06 07:32:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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:32:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456859065] [2022-12-06 07:32:20,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456859065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679766885] [2022-12-06 07:32:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:20,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:20,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,548 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:20,548 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:32:20,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:20,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:20,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:20,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:20,561 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:20,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:20,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:20,594 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:20,595 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:20,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,595 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,619 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:20,620 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:32:20,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:20,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:20,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:20,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:20,761 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:32:20,761 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:20,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,761 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2022-12-06 07:32:20,761 INFO L420 AbstractCegarLoop]: === Iteration 733 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash 363288768, now seen corresponding path program 1 times [2022-12-06 07:32:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746177565] [2022-12-06 07:32:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,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:32:20,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746177565] [2022-12-06 07:32:20,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746177565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773127001] [2022-12-06 07:32:20,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:20,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:20,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:20,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,106 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:21,106 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:21,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:21,119 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:21,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:21,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:21,119 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:21,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:21,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,171 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:21,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:21,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,171 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,196 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:21,196 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:21,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:21,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:21,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:32:21,343 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:21,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2022-12-06 07:32:21,343 INFO L420 AbstractCegarLoop]: === Iteration 734 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2106099103, now seen corresponding path program 1 times [2022-12-06 07:32:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503292616] [2022-12-06 07:32:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503292616] [2022-12-06 07:32:21,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503292616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329951379] [2022-12-06 07:32:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:21,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:21,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:21,682 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:21,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:21,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:21,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:21,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:21,696 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:21,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:21,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:21,730 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:21,731 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:21,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,731 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,755 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:21,755 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:21,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:21,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:21,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:21,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:21,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:21,897 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:21,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2022-12-06 07:32:21,897 INFO L420 AbstractCegarLoop]: === Iteration 735 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -446057858, now seen corresponding path program 1 times [2022-12-06 07:32:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335526093] [2022-12-06 07:32:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,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:32:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335526093] [2022-12-06 07:32:21,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335526093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:21,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782601274] [2022-12-06 07:32:21,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:21,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:21,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,276 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:22,276 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:32:22,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:22,290 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:22,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:22,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:22,290 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:22,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:22,322 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:22,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,322 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:22,347 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:32:22,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:22,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:22,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:32:22,505 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:22,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2022-12-06 07:32:22,506 INFO L420 AbstractCegarLoop]: === Iteration 736 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1296752477, now seen corresponding path program 1 times [2022-12-06 07:32:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642281662] [2022-12-06 07:32:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,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:32:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642281662] [2022-12-06 07:32:22,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642281662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:22,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:22,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529591637] [2022-12-06 07:32:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:22,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:22,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:22,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:22,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:22,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:22,901 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:22,902 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:22,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:22,917 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:22,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:22,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:22,918 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:22,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:22,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:22,954 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:22,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:22,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:22,955 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:22,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:22,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,980 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:22,981 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:32:22,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:22,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:22,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:23,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:32:23,126 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:23,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2022-12-06 07:32:23,126 INFO L420 AbstractCegarLoop]: === Iteration 737 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1255404484, now seen corresponding path program 1 times [2022-12-06 07:32:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105510605] [2022-12-06 07:32:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:23,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:32:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105510605] [2022-12-06 07:32:23,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105510605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965964379] [2022-12-06 07:32:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:23,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:23,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:23,493 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:23,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:23,506 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:23,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:23,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:23,507 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:23,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:23,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:23,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:23,540 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:23,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:23,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:23,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:23,566 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:23,566 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:32:23,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:23,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:23,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:23,707 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:23,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:32:23,708 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:23,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2022-12-06 07:32:23,708 INFO L420 AbstractCegarLoop]: === Iteration 738 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 487405851, now seen corresponding path program 1 times [2022-12-06 07:32:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323366395] [2022-12-06 07:32:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:23,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:32:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:23,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323366395] [2022-12-06 07:32:23,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323366395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:23,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:23,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892878178] [2022-12-06 07:32:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:23,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:23,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:23,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,034 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:24,034 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:24,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13507 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:24,048 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:24,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:24,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:24,049 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:24,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:24,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,087 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:24,087 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:24,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,087 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,114 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:24,114 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:32:24,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:24,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:24,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:32:24,260 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:24,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2022-12-06 07:32:24,261 INFO L420 AbstractCegarLoop]: === Iteration 739 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2064751110, now seen corresponding path program 1 times [2022-12-06 07:32:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73980541] [2022-12-06 07:32:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73980541] [2022-12-06 07:32:24,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73980541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829606277] [2022-12-06 07:32:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:24,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:24,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:24,642 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:24,643 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:24,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:24,656 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:24,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:24,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:24,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:24,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:24,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:24,691 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:24,691 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:24,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:24,691 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:24,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:24,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,717 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:24,717 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:24,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:24,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:24,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:24,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:24,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:32:24,870 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:24,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:24,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:24,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2022-12-06 07:32:24,870 INFO L420 AbstractCegarLoop]: === Iteration 740 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -321940775, now seen corresponding path program 1 times [2022-12-06 07:32:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:24,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228780005] [2022-12-06 07:32:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,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:32:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228780005] [2022-12-06 07:32:24,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228780005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:24,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:24,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228570919] [2022-12-06 07:32:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:24,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:24,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:24,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:24,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,189 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:25,190 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:25,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:25,202 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:25,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:25,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:25,203 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:25,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,236 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:25,236 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:25,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,236 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,261 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:25,261 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:25,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:25,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:25,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:25,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:32:25,412 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:25,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:25,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:25,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2022-12-06 07:32:25,412 INFO L420 AbstractCegarLoop]: === Iteration 741 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1420869560, now seen corresponding path program 1 times [2022-12-06 07:32:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:25,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297626354] [2022-12-06 07:32:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:25,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:32:25,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:25,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297626354] [2022-12-06 07:32:25,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297626354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:25,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:25,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618909477] [2022-12-06 07:32:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:25,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:25,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:25,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:25,799 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:25,799 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:25,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:25,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:25,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:25,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:25,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:25,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:25,849 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:25,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:25,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:25,850 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:25,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:25,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,880 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:25,880 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:25,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:25,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:26,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:32:26,031 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:26,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2022-12-06 07:32:26,031 INFO L420 AbstractCegarLoop]: === Iteration 742 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1131287401, now seen corresponding path program 1 times [2022-12-06 07:32:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860794104] [2022-12-06 07:32:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860794104] [2022-12-06 07:32:26,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860794104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851251163] [2022-12-06 07:32:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:26,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:26,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,371 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:26,371 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:26,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:26,384 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:26,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:26,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:26,385 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:26,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:26,419 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:26,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,419 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,445 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:26,445 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:32:26,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:26,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:26,596 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:26,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:32:26,596 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:26,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:26,596 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:26,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2022-12-06 07:32:26,596 INFO L420 AbstractCegarLoop]: === Iteration 743 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 611522934, now seen corresponding path program 1 times [2022-12-06 07:32:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839877035] [2022-12-06 07:32:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:26,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:32:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:26,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839877035] [2022-12-06 07:32:26,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839877035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:26,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:26,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901235723] [2022-12-06 07:32:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:26,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:26,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:26,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:26,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:26,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:26,950 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:26,950 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:26,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:26,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:26,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:26,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:26,961 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:26,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:26,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:26,992 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:26,992 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:26,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:26,992 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:26,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:26,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:26,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,017 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:27,017 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:27,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:27,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:27,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:32:27,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:27,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2022-12-06 07:32:27,162 INFO L420 AbstractCegarLoop]: === Iteration 744 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1940634027, now seen corresponding path program 1 times [2022-12-06 07:32:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328031957] [2022-12-06 07:32:27,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328031957] [2022-12-06 07:32:27,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328031957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18378807] [2022-12-06 07:32:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:27,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:27,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,510 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:27,510 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:27,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:27,524 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:27,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:27,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:27,525 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:27,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:27,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:27,560 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:27,561 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:27,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,561 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,586 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:27,586 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:32:27,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:27,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:27,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:27,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:27,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:32:27,723 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:27,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:27,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:27,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2022-12-06 07:32:27,723 INFO L420 AbstractCegarLoop]: === Iteration 745 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:27,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:27,723 INFO L85 PathProgramCache]: Analyzing trace with hash -197823692, now seen corresponding path program 1 times [2022-12-06 07:32:27,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:27,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751522503] [2022-12-06 07:32:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:27,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:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:27,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751522503] [2022-12-06 07:32:27,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751522503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:27,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:27,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621967585] [2022-12-06 07:32:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:27,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:27,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:27,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:27,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:27,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:27,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,064 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:28,065 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:28,078 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:28,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:28,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:28,079 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:28,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:28,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,112 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:28,112 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:28,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,112 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,137 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:28,137 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:28,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:28,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:28,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:32:28,300 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:28,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2022-12-06 07:32:28,300 INFO L420 AbstractCegarLoop]: === Iteration 746 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1544986643, now seen corresponding path program 1 times [2022-12-06 07:32:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131548530] [2022-12-06 07:32:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,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:32:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131548530] [2022-12-06 07:32:28,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131548530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692116717] [2022-12-06 07:32:28,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:28,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:28,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:28,651 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:28,651 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:28,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:28,665 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:28,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:28,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:28,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:28,666 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:28,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:28,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:28,701 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:28,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:28,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:28,701 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:28,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:28,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,726 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:28,726 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:28,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:28,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:28,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:28,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:28,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:32:28,863 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:28,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:28,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:28,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2022-12-06 07:32:28,863 INFO L420 AbstractCegarLoop]: === Iteration 747 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:28,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1007170318, now seen corresponding path program 1 times [2022-12-06 07:32:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:28,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865475440] [2022-12-06 07:32:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:28,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:32:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:28,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865475440] [2022-12-06 07:32:28,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865475440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:28,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:28,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130404221] [2022-12-06 07:32:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:28,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:28,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:28,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:28,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:28,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,198 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:29,198 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:29,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:29,211 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:29,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:29,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:29,211 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:29,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:29,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,245 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:29,245 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:29,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,245 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,270 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:29,270 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:32:29,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:29,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:29,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:32:29,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:29,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2022-12-06 07:32:29,414 INFO L420 AbstractCegarLoop]: === Iteration 748 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 735640017, now seen corresponding path program 1 times [2022-12-06 07:32:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724799225] [2022-12-06 07:32:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:29,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:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:29,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724799225] [2022-12-06 07:32:29,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724799225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:29,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:29,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606729363] [2022-12-06 07:32:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:29,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:29,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:29,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:29,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:29,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:29,744 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:29,744 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:32:29,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:29,757 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:29,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:29,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:29,758 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:29,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:29,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:29,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:29,792 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:29,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:29,792 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:29,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:29,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:29,817 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:32:29,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:29,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:29,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:29,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:29,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:32:29,958 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:29,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:29,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:29,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2022-12-06 07:32:29,958 INFO L420 AbstractCegarLoop]: === Iteration 749 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1816516944, now seen corresponding path program 1 times [2022-12-06 07:32:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:29,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423861724] [2022-12-06 07:32:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,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:32:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423861724] [2022-12-06 07:32:30,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423861724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818801711] [2022-12-06 07:32:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:30,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:30,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,301 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:30,301 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:30,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:30,315 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:30,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:30,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:30,316 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:30,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:30,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:30,356 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:30,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,356 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,382 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:30,382 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:30,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:30,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:30,535 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:30,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:32:30,535 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:30,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:30,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:30,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2022-12-06 07:32:30,535 INFO L420 AbstractCegarLoop]: === Iteration 750 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash -73706609, now seen corresponding path program 1 times [2022-12-06 07:32:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:30,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591430390] [2022-12-06 07:32:30,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:30,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591430390] [2022-12-06 07:32:30,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591430390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:30,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:30,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637356038] [2022-12-06 07:32:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:30,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:30,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:30,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:30,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:30,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:30,883 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:30,883 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:30,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:30,895 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:30,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:30,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:30,896 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:30,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:30,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:30,927 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:30,927 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:30,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:30,927 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:30,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:30,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:30,953 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:32:30,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:30,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:30,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:31,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:32:31,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:31,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2022-12-06 07:32:31,116 INFO L420 AbstractCegarLoop]: === Iteration 751 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1669103726, now seen corresponding path program 1 times [2022-12-06 07:32:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903349969] [2022-12-06 07:32:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:31,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:32:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903349969] [2022-12-06 07:32:31,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903349969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197182022] [2022-12-06 07:32:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:31,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:31,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:31,446 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:31,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:31,460 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:31,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:31,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:31,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:31,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:31,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:31,495 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:31,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:31,496 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:31,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:31,496 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:31,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:31,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:31,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:31,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:31,521 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:31,521 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:32:31,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:31,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:31,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:31,655 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:31,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:32:31,656 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:31,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:31,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:31,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2022-12-06 07:32:31,656 INFO L420 AbstractCegarLoop]: === Iteration 752 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash -883053235, now seen corresponding path program 1 times [2022-12-06 07:32:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:31,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436310604] [2022-12-06 07:32:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436310604] [2022-12-06 07:32:31,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436310604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:31,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:31,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625658335] [2022-12-06 07:32:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:31,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:31,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:31,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:31,976 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:31,976 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:31,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:31,991 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:31,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:31,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:31,992 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:32,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,029 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:32,029 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:32,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,029 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,055 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:32,055 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:32,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:32,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:32,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:32:32,207 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:32,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2022-12-06 07:32:32,207 INFO L420 AbstractCegarLoop]: === Iteration 753 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 859757100, now seen corresponding path program 1 times [2022-12-06 07:32:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255087020] [2022-12-06 07:32:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:32,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255087020] [2022-12-06 07:32:32,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255087020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916364119] [2022-12-06 07:32:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:32,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:32,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:32,556 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:32,556 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:32,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:32,570 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:32,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:32,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:32,571 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:32,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:32,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:32,605 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,606 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:32,606 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:32,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:32,606 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:32,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:32,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,631 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:32,631 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:32:32,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:32,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:32,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:32,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:32,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:32:32,792 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:32,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2022-12-06 07:32:32,792 INFO L420 AbstractCegarLoop]: === Iteration 754 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1692399861, now seen corresponding path program 1 times [2022-12-06 07:32:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594217821] [2022-12-06 07:32:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,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:32,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594217821] [2022-12-06 07:32:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594217821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:32,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111064555] [2022-12-06 07:32:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:32,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:32,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:32,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:32,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,120 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:33,121 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:33,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:33,138 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:33,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:33,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:33,139 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:33,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:33,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,176 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:33,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:33,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,176 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,202 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:33,202 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:32:33,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:33,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:33,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:32:33,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:33,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2022-12-06 07:32:33,340 INFO L420 AbstractCegarLoop]: === Iteration 755 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash 50410474, now seen corresponding path program 1 times [2022-12-06 07:32:33,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64111970] [2022-12-06 07:32:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,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:32:33,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64111970] [2022-12-06 07:32:33,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64111970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:33,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376879999] [2022-12-06 07:32:33,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:33,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:33,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:33,688 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:33,688 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:32:33,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:33,702 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:33,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:33,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:33,702 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:33,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:33,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:33,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:33,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:33,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:33,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:33,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:33,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,761 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:33,761 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:33,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:33,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:33,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:33,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:33,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:32:33,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:33,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:33,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:33,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2022-12-06 07:32:33,913 INFO L420 AbstractCegarLoop]: === Iteration 756 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1793220809, now seen corresponding path program 1 times [2022-12-06 07:32:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051905551] [2022-12-06 07:32:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,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:32:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:33,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051905551] [2022-12-06 07:32:33,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051905551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:33,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:33,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811409010] [2022-12-06 07:32:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:33,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:33,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,271 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:34,271 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:34,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:34,283 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:34,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:34,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:34,284 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:34,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:34,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,318 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:34,318 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:34,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,318 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,343 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:34,344 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:34,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:34,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:34,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:34,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:32:34,496 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:34,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:34,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:34,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2022-12-06 07:32:34,496 INFO L420 AbstractCegarLoop]: === Iteration 757 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash -758936152, now seen corresponding path program 1 times [2022-12-06 07:32:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:34,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734700018] [2022-12-06 07:32:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:34,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:32:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:34,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734700018] [2022-12-06 07:32:34,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734700018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:34,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236439938] [2022-12-06 07:32:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:34,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:34,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:34,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:34,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:34,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:34,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:34,845 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:34,845 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:34,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:34,858 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:34,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:34,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:34,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:34,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:34,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:34,889 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:34,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:34,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:34,889 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:34,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:34,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,915 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:34,915 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:32:34,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:34,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:34,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:35,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:32:35,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:35,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2022-12-06 07:32:35,063 INFO L420 AbstractCegarLoop]: === Iteration 758 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash 983874183, now seen corresponding path program 1 times [2022-12-06 07:32:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510701585] [2022-12-06 07:32:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:35,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:32:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510701585] [2022-12-06 07:32:35,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510701585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264847619] [2022-12-06 07:32:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:35,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:35,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,376 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:35,376 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:32:35,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13508 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:35,388 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:35,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:35,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:35,389 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:35,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:35,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,421 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:35,421 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:35,421 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,421 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,422 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,446 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:35,446 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:32:35,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:35,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:35,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:35,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:32:35,599 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:35,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:35,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:35,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2022-12-06 07:32:35,599 INFO L420 AbstractCegarLoop]: === Iteration 759 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:35,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:35,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1568282778, now seen corresponding path program 1 times [2022-12-06 07:32:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:35,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501725858] [2022-12-06 07:32:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:35,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:35,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501725858] [2022-12-06 07:32:35,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501725858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:35,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:35,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:35,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869601267] [2022-12-06 07:32:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:35,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:35,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:35,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:35,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:35,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:35,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:35,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:35,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:35,940 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:35,940 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:35,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:35,953 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:35,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:35,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:35,954 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:35,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:35,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:35,990 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:35,990 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:35,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:35,990 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:35,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:35,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,023 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:36,024 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:36,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:36,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:32:36,167 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:36,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2022-12-06 07:32:36,167 INFO L420 AbstractCegarLoop]: === Iteration 760 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 174527557, now seen corresponding path program 1 times [2022-12-06 07:32:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975571238] [2022-12-06 07:32:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:36,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:32:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975571238] [2022-12-06 07:32:36,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975571238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758074596] [2022-12-06 07:32:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:36,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:36,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,492 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:36,492 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:36,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:36,506 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:36,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:36,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:36,507 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:36,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:36,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:36,541 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:36,541 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:36,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,541 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,568 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:36,568 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:36,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:36,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:36,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:36,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:36,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:32:36,722 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:36,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:36,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2022-12-06 07:32:36,722 INFO L420 AbstractCegarLoop]: === Iteration 761 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1917337892, now seen corresponding path program 1 times [2022-12-06 07:32:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:36,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616139285] [2022-12-06 07:32:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616139285] [2022-12-06 07:32:36,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616139285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:36,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:36,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912785002] [2022-12-06 07:32:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:36,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:36,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:36,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:36,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:36,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,126 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:37,127 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:32:37,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:37,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:37,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:37,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:37,142 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:37,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:37,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,178 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:37,178 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:37,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,178 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,203 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:37,204 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:32:37,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:37,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:37,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:37,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:32:37,354 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:37,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:37,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:37,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2022-12-06 07:32:37,355 INFO L420 AbstractCegarLoop]: === Iteration 762 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -634819069, now seen corresponding path program 1 times [2022-12-06 07:32:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:37,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650643297] [2022-12-06 07:32:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:37,372 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 [1650643297] [2022-12-06 07:32:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650643297] 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 [4] imperfect sequences [] total 4 [2022-12-06 07:32:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614349294] [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=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:37,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:37,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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: 1 of 43 [2022-12-06 07:32:37,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:37,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:37,761 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:37,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:37,777 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:37,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:37,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:37,778 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:37,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:37,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:37,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:37,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:37,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:37,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:37,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:37,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,838 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:37,838 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:32:37,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:37,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:37,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:38,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 07:32:38,015 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:38,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2022-12-06 07:32:38,015 INFO L420 AbstractCegarLoop]: === Iteration 763 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1107991266, now seen corresponding path program 1 times [2022-12-06 07:32:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805257239] [2022-12-06 07:32:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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:32:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805257239] [2022-12-06 07:32:38,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805257239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939016054] [2022-12-06 07:32:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:38,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:38,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,390 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:38,390 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:38,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:38,404 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:38,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:38,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:38,405 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:38,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:38,442 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:38,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:38,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:38,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:38,442 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:38,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:38,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:38,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:38,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:38,469 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:38,469 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:38,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:38,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:38,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:38,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:38,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:38,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:38,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:38,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:38,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2022-12-06 07:32:38,607 INFO L420 AbstractCegarLoop]: === Iteration 764 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1444165695, now seen corresponding path program 1 times [2022-12-06 07:32:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:38,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892983851] [2022-12-06 07:32:38,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:38,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:38,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:32:38,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892983851] [2022-12-06 07:32:38,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892983851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:38,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:38,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561119672] [2022-12-06 07:32:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:38,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:38,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:38,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:38,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:38,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:38,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:38,967 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:38,967 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:38,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:38,978 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:38,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:38,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:38,978 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:38,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:39,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:39,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:39,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,033 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:39,033 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:39,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:39,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:39,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:32:39,182 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:39,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2022-12-06 07:32:39,182 INFO L420 AbstractCegarLoop]: === Iteration 765 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash 298644640, now seen corresponding path program 1 times [2022-12-06 07:32:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244100233] [2022-12-06 07:32:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,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:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244100233] [2022-12-06 07:32:39,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244100233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043310533] [2022-12-06 07:32:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:39,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:39,548 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:39,548 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:39,564 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:39,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:39,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:39,565 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:39,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:39,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:39,602 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:39,602 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:39,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:39,603 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:39,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:39,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,628 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:39,628 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:32:39,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:39,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:39,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:39,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:39,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:32:39,766 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:39,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:39,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:39,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2022-12-06 07:32:39,766 INFO L420 AbstractCegarLoop]: === Iteration 766 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2041454975, now seen corresponding path program 1 times [2022-12-06 07:32:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:39,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198941970] [2022-12-06 07:32:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:39,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:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:39,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198941970] [2022-12-06 07:32:39,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198941970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:39,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:39,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296446931] [2022-12-06 07:32:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:39,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:39,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:39,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:39,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:39,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:39,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:40,097 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:40,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:40,110 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:40,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:40,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:40,111 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:40,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:40,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,147 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:40,148 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:40,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,148 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,179 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:40,179 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:40,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:40,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:40,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:32:40,320 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2022-12-06 07:32:40,320 INFO L420 AbstractCegarLoop]: === Iteration 767 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -510701986, now seen corresponding path program 1 times [2022-12-06 07:32:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416996810] [2022-12-06 07:32:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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:32:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416996810] [2022-12-06 07:32:40,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416996810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922863007] [2022-12-06 07:32:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:40,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:40,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:40,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:40,674 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:40,688 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:40,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:40,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:40,689 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:40,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:40,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:40,723 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:40,723 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:40,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:40,723 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:40,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:40,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,749 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:40,749 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:40,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:40,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:40,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:40,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:40,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:32:40,897 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:40,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:40,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:40,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2022-12-06 07:32:40,897 INFO L420 AbstractCegarLoop]: === Iteration 768 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1232108349, now seen corresponding path program 1 times [2022-12-06 07:32:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:40,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575900930] [2022-12-06 07:32:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:40,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:40,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:40,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575900930] [2022-12-06 07:32:40,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575900930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:40,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:40,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906401826] [2022-12-06 07:32:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:40,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:40,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:40,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:40,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:40,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:41,231 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:41,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:41,244 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:41,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:41,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:41,244 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:41,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:41,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,278 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:41,278 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:41,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,278 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,303 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:41,303 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:32:41,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:41,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:41,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:41,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:32:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:41,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:41,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2022-12-06 07:32:41,442 INFO L420 AbstractCegarLoop]: === Iteration 769 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1320048612, now seen corresponding path program 1 times [2022-12-06 07:32:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:41,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068192287] [2022-12-06 07:32:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:41,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:32:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:41,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068192287] [2022-12-06 07:32:41,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068192287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:41,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969267944] [2022-12-06 07:32:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:41,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:41,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:41,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:41,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:41,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:41,777 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:41,777 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:41,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:41,789 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:41,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:41,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:41,790 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:41,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:41,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:41,825 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,825 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:41,825 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:41,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:41,825 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:41,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:41,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,850 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:41,851 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:41,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:41,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:41,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:42,006 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:32:42,007 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:42,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2022-12-06 07:32:42,007 INFO L420 AbstractCegarLoop]: === Iteration 770 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash 422761723, now seen corresponding path program 1 times [2022-12-06 07:32:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946636238] [2022-12-06 07:32:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:42,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:32:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946636238] [2022-12-06 07:32:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946636238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745787287] [2022-12-06 07:32:42,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:42,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:42,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,324 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:42,324 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:42,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13593 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:42,341 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:42,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:42,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:42,342 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:42,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:42,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,382 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:42,382 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:42,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,382 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,407 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:42,407 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:32:42,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:42,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:42,545 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:32:42,546 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:42,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2022-12-06 07:32:42,546 INFO L420 AbstractCegarLoop]: === Iteration 771 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2129395238, now seen corresponding path program 1 times [2022-12-06 07:32:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438179427] [2022-12-06 07:32:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:42,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:32:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:42,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438179427] [2022-12-06 07:32:42,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438179427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:42,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:42,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846243133] [2022-12-06 07:32:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:42,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:42,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:42,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:42,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:42,896 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:42,897 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:42,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:42,909 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:42,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:42,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:42,909 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:42,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:42,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:42,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:42,941 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:42,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:42,941 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:42,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:42,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,966 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:42,967 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:32:42,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:42,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:42,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:43,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:32:43,111 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:43,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2022-12-06 07:32:43,111 INFO L420 AbstractCegarLoop]: === Iteration 772 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash -386584903, now seen corresponding path program 1 times [2022-12-06 07:32:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956651212] [2022-12-06 07:32:43,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956651212] [2022-12-06 07:32:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956651212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398390911] [2022-12-06 07:32:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:43,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:43,443 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:43,443 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:32:43,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:43,458 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:43,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:43,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:43,459 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:43,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:43,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:43,498 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:43,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:43,498 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:43,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:43,498 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:43,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:43,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:43,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:43,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:43,524 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:43,524 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:32:43,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:43,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:43,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:43,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:43,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:32:43,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:43,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:43,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:43,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2022-12-06 07:32:43,665 INFO L420 AbstractCegarLoop]: === Iteration 773 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1356225432, now seen corresponding path program 1 times [2022-12-06 07:32:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:43,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184407559] [2022-12-06 07:32:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,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:32:43,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184407559] [2022-12-06 07:32:43,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184407559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:43,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:43,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585484696] [2022-12-06 07:32:43,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:43,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:43,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:43,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,022 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:44,022 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:44,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13592 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:44,038 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:44,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:44,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:44,039 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:44,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:44,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,077 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:44,077 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:44,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,077 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,110 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:44,110 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:44,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:44,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:44,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:32:44,252 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:44,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2022-12-06 07:32:44,252 INFO L420 AbstractCegarLoop]: === Iteration 774 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1195931529, now seen corresponding path program 1 times [2022-12-06 07:32:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064214155] [2022-12-06 07:32:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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:32:44,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064214155] [2022-12-06 07:32:44,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064214155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698161337] [2022-12-06 07:32:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:44,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:44,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:44,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:44,599 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:44,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:44,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:44,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:44,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:44,614 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:44,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:44,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:44,649 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:44,650 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:44,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:44,650 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:44,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:44,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,675 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:44,675 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:44,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:44,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:44,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:44,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:44,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:32:44,812 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:44,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:44,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:44,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2022-12-06 07:32:44,813 INFO L420 AbstractCegarLoop]: === Iteration 775 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash 546878806, now seen corresponding path program 1 times [2022-12-06 07:32:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822980868] [2022-12-06 07:32:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:44,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:32:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:44,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822980868] [2022-12-06 07:32:44,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822980868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:44,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:44,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077897463] [2022-12-06 07:32:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:44,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:44,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:44,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:44,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:44,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,144 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:45,144 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:45,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:45,157 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:45,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:45,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:45,158 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:45,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:45,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,191 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:45,191 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:45,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,191 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,215 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:45,215 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:45,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:45,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:45,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:32:45,381 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:45,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2022-12-06 07:32:45,381 INFO L420 AbstractCegarLoop]: === Iteration 776 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2005278155, now seen corresponding path program 1 times [2022-12-06 07:32:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789605517] [2022-12-06 07:32:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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:32:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789605517] [2022-12-06 07:32:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789605517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583968371] [2022-12-06 07:32:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:45,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:45,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:45,717 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:45,717 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:45,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:45,730 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:45,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:45,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:45,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:45,731 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:45,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:45,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:45,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:45,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:45,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:45,765 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:45,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:45,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,790 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:45,790 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:32:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3011 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:45,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:45,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:45,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:45,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:32:45,926 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:45,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:45,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:45,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2022-12-06 07:32:45,926 INFO L420 AbstractCegarLoop]: === Iteration 777 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash -262467820, now seen corresponding path program 1 times [2022-12-06 07:32:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607109628] [2022-12-06 07:32:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:45,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:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607109628] [2022-12-06 07:32:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607109628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:45,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021121431] [2022-12-06 07:32:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:45,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:45,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:45,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:45,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,244 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:46,245 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:32:46,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:46,257 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:46,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:46,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:46,258 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:46,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:46,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,290 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:46,290 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:46,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,290 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,316 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:46,316 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:32:46,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:46,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:46,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:32:46,449 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:46,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2022-12-06 07:32:46,449 INFO L420 AbstractCegarLoop]: === Iteration 778 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1480342515, now seen corresponding path program 1 times [2022-12-06 07:32:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898532622] [2022-12-06 07:32:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898532622] [2022-12-06 07:32:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898532622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:46,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:46,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66431335] [2022-12-06 07:32:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:46,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:46,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:46,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:46,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:46,787 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:46,787 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:46,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13513 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:46,798 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:46,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:46,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:46,799 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:46,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:46,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:46,830 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:46,830 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:46,830 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:46,830 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:46,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:46,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,855 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:46,855 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:46,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:46,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:46,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:46,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:46,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:32:46,990 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:46,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:46,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:46,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2022-12-06 07:32:46,990 INFO L420 AbstractCegarLoop]: === Iteration 779 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1071814446, now seen corresponding path program 1 times [2022-12-06 07:32:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120793812] [2022-12-06 07:32:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:46,990 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,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:32:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120793812] [2022-12-06 07:32:47,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120793812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892175462] [2022-12-06 07:32:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:47,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:47,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,322 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:47,323 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:47,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:47,336 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:47,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:47,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:47,337 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:47,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:47,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,372 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:47,372 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:47,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,373 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,398 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:47,398 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:32:47,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:47,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:47,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:47,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:32:47,550 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:47,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:47,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:47,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2022-12-06 07:32:47,551 INFO L420 AbstractCegarLoop]: === Iteration 780 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:47,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash 670995889, now seen corresponding path program 1 times [2022-12-06 07:32:47,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:47,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344793149] [2022-12-06 07:32:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:47,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:47,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:32:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:47,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344793149] [2022-12-06 07:32:47,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344793149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:47,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:47,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454124614] [2022-12-06 07:32:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:47,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:47,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:47,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:47,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:47,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:47,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:47,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,889 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:47,889 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:47,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:47,902 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:47,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:47,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:47,903 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:47,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:47,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:47,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:47,940 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:47,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,940 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,973 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:47,973 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:32:47,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:47,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:47,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:48,114 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:32:48,114 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2022-12-06 07:32:48,115 INFO L420 AbstractCegarLoop]: === Iteration 781 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1881161072, now seen corresponding path program 1 times [2022-12-06 07:32:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191859469] [2022-12-06 07:32:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,129 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 [1191859469] [2022-12-06 07:32:48,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191859469] 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,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210591527] [2022-12-06 07:32:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,186 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=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:48,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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: 1 of 43 [2022-12-06 07:32:48,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:48,458 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:48,458 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:48,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:48,471 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:48,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:48,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:48,472 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:48,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:48,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:48,506 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:48,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:48,507 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:48,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:48,507 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:48,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:48,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:48,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:48,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:48,531 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:48,532 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:32:48,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:48,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:48,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:48,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:32:48,679 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:48,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2022-12-06 07:32:48,679 INFO L420 AbstractCegarLoop]: === Iteration 782 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash -138350737, now seen corresponding path program 1 times [2022-12-06 07:32:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720396461] [2022-12-06 07:32:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:48,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720396461] [2022-12-06 07:32:48,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720396461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:48,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:48,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401851758] [2022-12-06 07:32:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:48,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:48,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:48,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:48,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:48,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,030 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:49,030 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:49,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:49,043 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:49,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:49,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:49,044 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:49,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:49,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,080 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:49,080 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:49,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,080 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,105 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:49,105 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:49,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [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: 161 [2022-12-06 07:32:49,241 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:49,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2022-12-06 07:32:49,241 INFO L420 AbstractCegarLoop]: === Iteration 783 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1604459598, now seen corresponding path program 1 times [2022-12-06 07:32:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858409510] [2022-12-06 07:32:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,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:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858409510] [2022-12-06 07:32:49,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858409510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898727292] [2022-12-06 07:32:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:49,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:49,561 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:49,561 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:49,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:49,575 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:49,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:49,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:49,575 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:49,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:49,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:49,608 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:49,609 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:49,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:49,609 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:49,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:49,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,633 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:49,634 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:49,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:49,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:49,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:49,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:49,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:32:49,782 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:49,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:49,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2022-12-06 07:32:49,782 INFO L420 AbstractCegarLoop]: === Iteration 784 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -947697363, now seen corresponding path program 1 times [2022-12-06 07:32:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:49,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863528014] [2022-12-06 07:32:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,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:32:49,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863528014] [2022-12-06 07:32:49,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863528014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:49,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:49,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622260709] [2022-12-06 07:32:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:49,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:49,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:49,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:49,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,106 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:50,106 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:32:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:50,120 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:50,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:50,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:50,121 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:50,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:50,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,160 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:50,161 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:50,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,161 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,186 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:50,187 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:50,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:50,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:50,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:32:50,336 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:50,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2022-12-06 07:32:50,337 INFO L420 AbstractCegarLoop]: === Iteration 785 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash 795112972, now seen corresponding path program 1 times [2022-12-06 07:32:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889459194] [2022-12-06 07:32:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,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:32:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889459194] [2022-12-06 07:32:50,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889459194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385643733] [2022-12-06 07:32:50,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:50,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:50,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:50,693 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:50,693 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:32:50,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:50,704 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:50,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:50,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:50,705 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:50,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:50,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:50,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:50,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:50,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:50,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:50,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:50,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,761 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:50,761 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:32:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:50,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:50,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:50,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:50,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:32:50,898 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:50,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:50,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2022-12-06 07:32:50,899 INFO L420 AbstractCegarLoop]: === Iteration 786 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1757043989, now seen corresponding path program 1 times [2022-12-06 07:32:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:50,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135149062] [2022-12-06 07:32:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:50,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:50,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:50,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135149062] [2022-12-06 07:32:50,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135149062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:50,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:50,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202652662] [2022-12-06 07:32:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:50,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:50,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:50,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:50,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:50,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:50,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,254 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:51,254 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:51,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13561 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:51,269 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:51,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:51,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:51,269 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:51,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:51,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:51,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,306 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,334 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:51,334 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:51,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:51,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:51,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:51,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:32:51,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:51,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:51,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:51,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2022-12-06 07:32:51,493 INFO L420 AbstractCegarLoop]: === Iteration 787 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash -14233654, now seen corresponding path program 1 times [2022-12-06 07:32:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:51,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491692934] [2022-12-06 07:32:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:51,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:32:51,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:51,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491692934] [2022-12-06 07:32:51,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491692934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:51,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:51,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757965867] [2022-12-06 07:32:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:51,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:51,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:51,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:51,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:51,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:51,856 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:51,856 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:51,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:51,870 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:51,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:51,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:51,871 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:51,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:51,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:51,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:51,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:51,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:51,914 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:51,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:51,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,948 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:51,948 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:32:51,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:51,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:51,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:52,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:32:52,097 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:52,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2022-12-06 07:32:52,097 INFO L420 AbstractCegarLoop]: === Iteration 788 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1728576681, now seen corresponding path program 1 times [2022-12-06 07:32:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596487839] [2022-12-06 07:32:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32: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:32:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596487839] [2022-12-06 07:32:52,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596487839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736513110] [2022-12-06 07:32:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:52,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:52,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,411 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:52,412 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:32:52,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13513 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:52,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:52,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:52,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:52,425 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:52,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:52,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:52,459 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:52,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:52,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:52,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:52,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:52,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:52,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:52,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:52,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:52,484 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:52,484 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:32:52,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:52,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:52,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:52,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:52,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:32:52,629 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:52,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:52,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:52,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2022-12-06 07:32:52,629 INFO L420 AbstractCegarLoop]: === Iteration 789 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash -823580280, now seen corresponding path program 1 times [2022-12-06 07:32:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120047901] [2022-12-06 07:32:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:52,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120047901] [2022-12-06 07:32:52,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120047901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:52,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:52,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451418608] [2022-12-06 07:32:52,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:52,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:52,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:52,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:52,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:52,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:52,971 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:52,972 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:52,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:52,990 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:52,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:52,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:52,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:52,991 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:52,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:53,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,035 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:53,035 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:53,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,035 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,064 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:53,064 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:53,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:53,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:53,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:32:53,204 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:53,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2022-12-06 07:32:53,204 INFO L420 AbstractCegarLoop]: === Iteration 790 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 919230055, now seen corresponding path program 1 times [2022-12-06 07:32:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861446367] [2022-12-06 07:32:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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:32:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861446367] [2022-12-06 07:32:53,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861446367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620207664] [2022-12-06 07:32:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:53,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:53,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:53,556 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:53,557 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:53,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:53,569 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:53,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:53,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:53,570 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:53,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:53,603 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:53,603 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:53,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:53,603 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:53,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:53,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,628 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:53,628 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:53,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:53,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:53,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:53,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:53,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:53,768 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:53,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:53,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:53,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2022-12-06 07:32:53,768 INFO L420 AbstractCegarLoop]: === Iteration 791 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1632926906, now seen corresponding path program 1 times [2022-12-06 07:32:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:53,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359450460] [2022-12-06 07:32:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:53,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:32:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:53,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359450460] [2022-12-06 07:32:53,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359450460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:53,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:53,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174547758] [2022-12-06 07:32:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:53,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:53,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:53,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:53,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:53,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,109 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:54,109 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:54,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:54,123 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:54,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:54,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:54,124 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:54,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:54,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,160 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,160 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:54,160 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:54,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,160 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,187 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:54,187 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:54,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:54,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:54,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:32:54,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2022-12-06 07:32:54,353 INFO L420 AbstractCegarLoop]: === Iteration 792 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash 109883429, now seen corresponding path program 1 times [2022-12-06 07:32:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654639252] [2022-12-06 07:32:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,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:54,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654639252] [2022-12-06 07:32:54,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654639252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803605928] [2022-12-06 07:32:54,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:54,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:54,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:54,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,720 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:54,720 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:54,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:54,732 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:54,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:54,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:54,732 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:54,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:54,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:54,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:54,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:54,765 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:54,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:54,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,790 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:54,790 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:54,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:54,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:54,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:54,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:32:54,940 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:54,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:54,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:54,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2022-12-06 07:32:54,940 INFO L420 AbstractCegarLoop]: === Iteration 793 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1852693764, now seen corresponding path program 1 times [2022-12-06 07:32:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884540408] [2022-12-06 07:32:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:54,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:32:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:54,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884540408] [2022-12-06 07:32:54,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884540408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:54,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:54,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055857774] [2022-12-06 07:32:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:54,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:54,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:54,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:55,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:55,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:55,267 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:55,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:55,281 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:55,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:55,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:55,282 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:55,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:55,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,315 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,315 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:55,316 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:55,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,316 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,341 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:55,341 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:32:55,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:55,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:55,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:55,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:32:55,480 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:55,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2022-12-06 07:32:55,481 INFO L420 AbstractCegarLoop]: === Iteration 794 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -699463197, now seen corresponding path program 1 times [2022-12-06 07:32:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002497802] [2022-12-06 07:32:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:55,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:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002497802] [2022-12-06 07:32:55,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002497802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:55,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:55,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62942795] [2022-12-06 07:32:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:55,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:55,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:55,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:55,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:55,835 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:55,835 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:32:55,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:55,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:55,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:55,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:55,850 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:55,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:55,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:55,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:55,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,884 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,917 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:55,917 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:32:55,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:55,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:55,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:56,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:32:56,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:56,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2022-12-06 07:32:56,063 INFO L420 AbstractCegarLoop]: === Iteration 795 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1043347138, now seen corresponding path program 1 times [2022-12-06 07:32:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883686515] [2022-12-06 07:32:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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:32:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883686515] [2022-12-06 07:32:56,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883686515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325891356] [2022-12-06 07:32:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:56,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:56,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,407 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:56,407 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:32:56,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:56,420 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:56,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:56,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:56,421 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:56,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:56,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:56,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:56,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:56,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:56,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:56,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:56,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:56,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:56,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:56,480 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:56,480 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:56,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:56,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:56,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:56,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:56,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:32:56,632 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:56,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2022-12-06 07:32:56,632 INFO L420 AbstractCegarLoop]: === Iteration 796 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:56,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1508809823, now seen corresponding path program 1 times [2022-12-06 07:32:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:56,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946547322] [2022-12-06 07:32:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,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:32:56,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946547322] [2022-12-06 07:32:56,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946547322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:56,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:56,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:56,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953424222] [2022-12-06 07:32:56,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:56,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:56,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:56,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:56,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:56,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:56,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:56,948 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:32:56,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:56,963 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:56,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:56,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:56,964 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:56,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:57,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:57,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:57,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,032 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:32:57,033 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:32:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2963 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:32:57,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:57,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:32:57,170 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:57,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2022-12-06 07:32:57,170 INFO L420 AbstractCegarLoop]: === Iteration 797 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 234000512, now seen corresponding path program 1 times [2022-12-06 07:32:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089547842] [2022-12-06 07:32:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,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:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089547842] [2022-12-06 07:32:57,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089547842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023405612] [2022-12-06 07:32:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:57,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:57,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:57,503 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:57,503 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:57,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:57,517 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:57,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:57,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:57,518 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:57,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:57,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:57,553 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:57,553 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:57,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:57,553 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:57,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:57,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,578 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:57,578 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:32:57,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:57,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:57,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:57,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:57,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:32:57,715 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:57,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:57,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:57,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2022-12-06 07:32:57,715 INFO L420 AbstractCegarLoop]: === Iteration 798 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1976810847, now seen corresponding path program 1 times [2022-12-06 07:32:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:57,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572004109] [2022-12-06 07:32:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:57,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:32:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:57,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572004109] [2022-12-06 07:32:57,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572004109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:57,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:57,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681872259] [2022-12-06 07:32:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:57,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:57,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:57,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:57,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:58,056 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:58,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:58,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:58,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:58,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:58,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:58,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:58,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,105 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:58,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:58,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,130 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:58,131 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:32:58,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:58,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:58,278 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:32:58,279 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:58,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2022-12-06 07:32:58,279 INFO L420 AbstractCegarLoop]: === Iteration 799 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -575346114, now seen corresponding path program 1 times [2022-12-06 07:32:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588484264] [2022-12-06 07:32:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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:32:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588484264] [2022-12-06 07:32:58,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588484264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096973728] [2022-12-06 07:32:58,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:58,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:58,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:58,620 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:58,620 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:32:58,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:58,631 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:58,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:58,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:58,632 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:58,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:58,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:58,662 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:58,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:58,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:58,662 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:58,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:58,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,687 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:58,687 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:32:58,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:58,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:58,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:58,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:58,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:32:58,827 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:58,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:58,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:58,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2022-12-06 07:32:58,828 INFO L420 AbstractCegarLoop]: === Iteration 800 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1167464221, now seen corresponding path program 1 times [2022-12-06 07:32:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789988225] [2022-12-06 07:32:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:58,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:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:58,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789988225] [2022-12-06 07:32:58,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789988225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:58,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:58,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:58,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641471704] [2022-12-06 07:32:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:58,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:58,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:58,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:58,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:58,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,168 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:59,169 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:59,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:59,182 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:59,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:59,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:59,183 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:59,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:59,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,217 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:59,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:59,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,242 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:59,243 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:32:59,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:59,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:59,394 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:32:59,394 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:59,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2022-12-06 07:32:59,394 INFO L420 AbstractCegarLoop]: === Iteration 801 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1384692740, now seen corresponding path program 1 times [2022-12-06 07:32:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149931251] [2022-12-06 07:32:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:59,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:32:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:59,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149931251] [2022-12-06 07:32:59,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149931251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:59,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:59,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:59,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287592805] [2022-12-06 07:32:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:59,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:59,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:32:59,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:32:59,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:59,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:32:59,719 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:32:59,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:32:59,731 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:32:59,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:32:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:32:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:32:59,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:32:59,732 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:32:59,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:32:59,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:59,765 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,765 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:32:59,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:32:59,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:59,765 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:59,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:59,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,796 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:32:59,796 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:32:59,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:32:59,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:32:59,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:32:59,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:59,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:32:59,948 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:32:59,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:59,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:59,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2022-12-06 07:32:59,949 INFO L420 AbstractCegarLoop]: === Iteration 802 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:32:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 358117595, now seen corresponding path program 1 times [2022-12-06 07:32:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:59,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740868724] [2022-12-06 07:32:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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:33:00,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740868724] [2022-12-06 07:33:00,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740868724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456304314] [2022-12-06 07:33:00,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:00,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:00,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:00,275 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:00,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:00,289 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:00,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:00,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:00,290 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:00,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:00,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,324 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:00,325 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:00,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,325 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,350 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:00,351 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:33:00,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:00,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:00,485 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:00,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:33:00,486 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:00,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:00,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:00,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2022-12-06 07:33:00,486 INFO L420 AbstractCegarLoop]: === Iteration 803 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2100927930, now seen corresponding path program 1 times [2022-12-06 07:33:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:00,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632619512] [2022-12-06 07:33:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:00,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:33:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:00,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632619512] [2022-12-06 07:33:00,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632619512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:00,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:00,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698938412] [2022-12-06 07:33:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:00,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:00,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:00,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:00,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:00,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:00,828 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:00,828 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:00,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:00,842 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:00,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:00,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:00,843 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:00,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:00,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:00,879 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:00,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:00,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:00,879 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:00,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:00,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,904 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:00,904 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:33:00,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:00,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:00,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:01,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:33:01,047 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:01,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2022-12-06 07:33:01,047 INFO L420 AbstractCegarLoop]: === Iteration 804 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash -451229031, now seen corresponding path program 1 times [2022-12-06 07:33:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041084920] [2022-12-06 07:33:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,062 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 [1041084920] [2022-12-06 07:33:01,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041084920] 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 [4] imperfect sequences [] total 4 [2022-12-06 07:33:01,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190732936] [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=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:01,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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: 1 of 43 [2022-12-06 07:33:01,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,379 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:01,379 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:01,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:01,392 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:01,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:01,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:01,393 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:01,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:01,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:01,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:01,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,454 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:01,454 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:33:01,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:01,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:01,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:01,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:33:01,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:01,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:01,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:01,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2022-12-06 07:33:01,588 INFO L420 AbstractCegarLoop]: === Iteration 805 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1291581304, now seen corresponding path program 1 times [2022-12-06 07:33:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:01,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110950933] [2022-12-06 07:33:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:01,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:33:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110950933] [2022-12-06 07:33:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110950933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:01,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:01,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136313714] [2022-12-06 07:33:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:01,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:01,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:01,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:01,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:01,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:01,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:01,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:01,919 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:01,920 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:01,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:01,935 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:01,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:01,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:01,936 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:01,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:01,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:01,976 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:01,976 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:01,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:01,976 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:01,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:01,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:01,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,002 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:02,002 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:33:02,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:02,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:02,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:02,151 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:02,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2022-12-06 07:33:02,151 INFO L420 AbstractCegarLoop]: === Iteration 806 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1260575657, now seen corresponding path program 1 times [2022-12-06 07:33:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186887393] [2022-12-06 07:33:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186887393] [2022-12-06 07:33:02,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186887393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773978081] [2022-12-06 07:33:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:02,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:02,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:02,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:02,511 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:02,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:02,525 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:02,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:02,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:02,526 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:02,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:02,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:02,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:02,559 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:02,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:02,559 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:02,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:02,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,584 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:02,585 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:02,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:02,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:02,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:02,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:02,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:33:02,724 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:02,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:02,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2022-12-06 07:33:02,724 INFO L420 AbstractCegarLoop]: === Iteration 807 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 482234678, now seen corresponding path program 1 times [2022-12-06 07:33:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:02,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346785711] [2022-12-06 07:33:02,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:02,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:02,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:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:02,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346785711] [2022-12-06 07:33:02,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346785711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:02,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:02,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028345443] [2022-12-06 07:33:02,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:02,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:02,791 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:02,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:02,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:02,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,064 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:03,064 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:03,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:03,078 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:03,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:03,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:03,079 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:03,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:03,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,113 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:03,113 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:03,113 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,113 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,114 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,138 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:03,138 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:03,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:03,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:03,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:33:03,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:03,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2022-12-06 07:33:03,282 INFO L420 AbstractCegarLoop]: === Iteration 808 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2069922283, now seen corresponding path program 1 times [2022-12-06 07:33:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114813726] [2022-12-06 07:33:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114813726] [2022-12-06 07:33:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114813726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288107836] [2022-12-06 07:33:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:03,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:03,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:03,635 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:03,635 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:03,650 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:03,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:03,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:03,650 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:03,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:03,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:03,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:03,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:03,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:03,707 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:03,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:03,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,734 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:03,734 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:03,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:03,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:03,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:03,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:33:03,893 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:03,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:03,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:03,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2022-12-06 07:33:03,893 INFO L420 AbstractCegarLoop]: === Iteration 809 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash -327111948, now seen corresponding path program 1 times [2022-12-06 07:33:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:03,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244924677] [2022-12-06 07:33:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:03,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:33:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:03,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244924677] [2022-12-06 07:33:03,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244924677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:03,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:03,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794135747] [2022-12-06 07:33:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:03,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:03,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:03,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:03,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:03,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,227 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:04,227 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:04,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13554 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:04,242 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:04,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:04,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:04,242 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:04,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:04,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,278 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:04,279 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:04,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,279 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,304 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:04,304 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:33:04,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:04,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:04,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:04,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:33:04,445 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:04,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:04,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:04,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2022-12-06 07:33:04,446 INFO L420 AbstractCegarLoop]: === Iteration 810 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1415698387, now seen corresponding path program 1 times [2022-12-06 07:33:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:04,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910915431] [2022-12-06 07:33:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:04,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:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910915431] [2022-12-06 07:33:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910915431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:04,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099984241] [2022-12-06 07:33:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:04,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:04,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:04,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:04,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:04,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:04,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:04,800 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:04,800 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:33:04,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:04,815 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:04,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:04,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:04,816 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:04,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:04,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:04,853 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:04,853 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:04,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:04,853 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:04,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:04,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,878 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:04,878 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:04,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:04,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:04,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:05,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:33:05,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:05,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2022-12-06 07:33:05,024 INFO L420 AbstractCegarLoop]: === Iteration 811 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1136458574, now seen corresponding path program 1 times [2022-12-06 07:33:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135741610] [2022-12-06 07:33:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135741610] [2022-12-06 07:33:05,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135741610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:05,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311656127] [2022-12-06 07:33:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:05,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,385 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:05,386 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:05,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:05,400 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:05,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:05,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:05,401 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:05,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:05,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:05,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:05,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,438 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,464 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:05,464 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:05,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:05,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:05,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:05,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:33:05,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:05,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:05,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:05,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2022-12-06 07:33:05,602 INFO L420 AbstractCegarLoop]: === Iteration 812 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 606351761, now seen corresponding path program 1 times [2022-12-06 07:33:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:05,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311009841] [2022-12-06 07:33:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:05,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:33:05,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:05,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311009841] [2022-12-06 07:33:05,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311009841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:05,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:05,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222983664] [2022-12-06 07:33:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:05,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:05,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:05,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:05,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:05,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:05,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:05,939 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:05,939 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:05,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:05,954 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:05,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:05,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:05,955 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:05,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:05,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:05,994 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:05,994 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:05,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:05,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:05,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:05,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:05,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,019 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:06,020 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:06,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:06,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:06,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:33:06,165 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:06,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2022-12-06 07:33:06,165 INFO L420 AbstractCegarLoop]: === Iteration 813 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1945805200, now seen corresponding path program 1 times [2022-12-06 07:33:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825763984] [2022-12-06 07:33:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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:33:06,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825763984] [2022-12-06 07:33:06,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825763984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52205900] [2022-12-06 07:33:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:06,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:06,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,518 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:06,518 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:06,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:06,531 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:06,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:06,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:06,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:06,532 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:06,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:06,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:06,573 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:06,574 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:06,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:06,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:06,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:06,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:06,608 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:33:06,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:06,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:06,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:06,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:06,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:33:06,766 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:06,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:06,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:06,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2022-12-06 07:33:06,766 INFO L420 AbstractCegarLoop]: === Iteration 814 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash -202994865, now seen corresponding path program 1 times [2022-12-06 07:33:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:06,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971956140] [2022-12-06 07:33:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:06,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:06,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:06,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:06,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971956140] [2022-12-06 07:33:06,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971956140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:06,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:06,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846302177] [2022-12-06 07:33:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:06,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:06,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:06,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:06,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,148 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:07,148 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:07,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:07,164 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:07,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:07,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:07,165 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:07,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:07,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,203 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:07,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:07,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,229 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:07,229 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:33:07,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:07,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:07,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:33:07,370 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:07,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2022-12-06 07:33:07,370 INFO L420 AbstractCegarLoop]: === Iteration 815 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1539815470, now seen corresponding path program 1 times [2022-12-06 07:33:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939121794] [2022-12-06 07:33:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:07,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:33:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:07,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939121794] [2022-12-06 07:33:07,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939121794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:07,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:07,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:07,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885922220] [2022-12-06 07:33:07,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:07,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:07,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:07,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:07,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:07,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:07,738 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:07,739 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:07,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:07,749 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:07,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:07,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:07,749 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:07,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:07,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:07,781 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:07,781 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:07,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:07,781 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:07,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:07,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,807 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:07,807 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:07,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:07,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:07,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:07,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:07,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:33:07,947 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:07,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:07,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:07,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2022-12-06 07:33:07,947 INFO L420 AbstractCegarLoop]: === Iteration 816 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1012341491, now seen corresponding path program 1 times [2022-12-06 07:33:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:07,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688197047] [2022-12-06 07:33:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688197047] [2022-12-06 07:33:08,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688197047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394713422] [2022-12-06 07:33:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:08,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:08,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,278 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:08,278 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:08,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:08,292 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:08,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:08,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:08,292 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:08,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,327 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:08,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:08,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,352 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:08,352 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:08,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:08,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:08,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:08,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:33:08,499 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:08,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:08,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:08,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2022-12-06 07:33:08,499 INFO L420 AbstractCegarLoop]: === Iteration 817 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:08,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash 730468844, now seen corresponding path program 1 times [2022-12-06 07:33:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:08,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629303693] [2022-12-06 07:33:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:08,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:33:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:08,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629303693] [2022-12-06 07:33:08,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629303693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:08,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:08,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230523757] [2022-12-06 07:33:08,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:08,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:08,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:08,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:08,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:08,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:08,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:08,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:08,850 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:08,850 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13553 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:08,864 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:08,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:08,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:08,865 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:08,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:08,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:08,901 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:08,901 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:08,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:08,902 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:08,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:08,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,927 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:08,927 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 07:33:08,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:08,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:08,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:09,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:33:09,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:09,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2022-12-06 07:33:09,075 INFO L420 AbstractCegarLoop]: === Iteration 818 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1821688117, now seen corresponding path program 1 times [2022-12-06 07:33:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615880042] [2022-12-06 07:33:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:09,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:33:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615880042] [2022-12-06 07:33:09,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615880042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478994287] [2022-12-06 07:33:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:09,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:09,465 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:09,466 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:33:09,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:09,479 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:09,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:09,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:09,480 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:09,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,515 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:09,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:09,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:09,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,515 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:09,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:09,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:09,540 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:09,541 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:09,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:09,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:09,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:09,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:09,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:33:09,683 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:09,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:09,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:09,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2022-12-06 07:33:09,684 INFO L420 AbstractCegarLoop]: === Iteration 819 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -78877782, now seen corresponding path program 1 times [2022-12-06 07:33:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132956240] [2022-12-06 07:33:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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:33:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132956240] [2022-12-06 07:33:09,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132956240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:09,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:09,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:09,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344723805] [2022-12-06 07:33:09,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:09,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:09,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:09,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:09,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:09,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,026 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:10,026 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:10,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:10,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:10,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:10,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:10,041 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:10,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:10,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,074 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:10,074 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:10,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,074 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,099 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:10,100 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:10,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:10,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:10,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:33:10,244 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:10,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2022-12-06 07:33:10,245 INFO L420 AbstractCegarLoop]: === Iteration 820 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1663932553, now seen corresponding path program 1 times [2022-12-06 07:33:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89109974] [2022-12-06 07:33:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,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:33:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89109974] [2022-12-06 07:33:10,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89109974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109666730] [2022-12-06 07:33:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:10,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:10,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:10,610 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:10,611 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:10,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:10,627 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:10,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:10,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:10,628 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:10,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:10,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:10,662 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:10,663 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:10,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:10,663 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:10,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:10,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,688 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:10,688 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:33:10,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:10,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:10,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:10,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:10,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:33:10,834 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:10,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:10,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:10,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2022-12-06 07:33:10,835 INFO L420 AbstractCegarLoop]: === Iteration 821 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:10,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash -888224408, now seen corresponding path program 1 times [2022-12-06 07:33:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:10,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934244230] [2022-12-06 07:33:10,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:10,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:33:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934244230] [2022-12-06 07:33:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934244230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:10,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:10,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064238654] [2022-12-06 07:33:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:10,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:10,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:10,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:10,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:10,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:10,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,152 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:11,152 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:11,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:11,165 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:11,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:11,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:11,165 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:11,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:11,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,197 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,197 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:11,197 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:11,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,197 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,222 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:11,222 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:33:11,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:11,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:11,372 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:11,372 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:11,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2022-12-06 07:33:11,372 INFO L420 AbstractCegarLoop]: === Iteration 822 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 854585927, now seen corresponding path program 1 times [2022-12-06 07:33:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001568868] [2022-12-06 07:33:11,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:11,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:33:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:11,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001568868] [2022-12-06 07:33:11,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001568868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:11,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:11,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:11,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432858720] [2022-12-06 07:33:11,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:11,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:11,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:11,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:11,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:11,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:11,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:11,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:11,723 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:11,723 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:11,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:11,733 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:11,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:11,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:11,734 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:11,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:11,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:11,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:11,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:11,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:11,764 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:11,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:11,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,789 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:11,789 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:11,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:11,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:11,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:11,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:11,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:33:11,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:11,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:11,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:11,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2022-12-06 07:33:11,957 INFO L420 AbstractCegarLoop]: === Iteration 823 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1697571034, now seen corresponding path program 1 times [2022-12-06 07:33:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:11,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546417080] [2022-12-06 07:33:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,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:33:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546417080] [2022-12-06 07:33:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546417080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559870606] [2022-12-06 07:33:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:12,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:12,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,276 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:12,276 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:33:12,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:12,289 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:12,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:12,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:12,290 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:12,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:12,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,323 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:12,323 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:12,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:12,349 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:33:12,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:12,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:12,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:33:12,500 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:12,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2022-12-06 07:33:12,500 INFO L420 AbstractCegarLoop]: === Iteration 824 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash 45239301, now seen corresponding path program 1 times [2022-12-06 07:33:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340406407] [2022-12-06 07:33:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:12,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:33:12,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:12,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340406407] [2022-12-06 07:33:12,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340406407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:12,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:12,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849522781] [2022-12-06 07:33:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:12,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:12,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:12,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:12,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:12,824 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:12,825 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:12,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:12,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:12,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:12,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:12,839 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:12,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:12,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:12,874 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:12,874 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:12,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:12,874 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:12,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:12,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,899 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:12,899 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:12,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:12,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:12,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:13,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:33:13,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:13,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2022-12-06 07:33:13,054 INFO L420 AbstractCegarLoop]: === Iteration 825 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:13,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1788049636, now seen corresponding path program 1 times [2022-12-06 07:33:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687331556] [2022-12-06 07:33:13,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687331556] [2022-12-06 07:33:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687331556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483305331] [2022-12-06 07:33:13,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:13,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,397 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:13,398 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:13,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:13,417 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:13,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:13,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:13,418 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:13,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:13,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:13,455 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:13,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:13,455 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:13,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:13,455 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:13,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:13,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:13,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:13,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:13,481 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:13,481 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:33:13,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:13,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:13,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:13,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:13,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:33:13,637 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:13,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:13,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:13,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2022-12-06 07:33:13,637 INFO L420 AbstractCegarLoop]: === Iteration 826 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -764107325, now seen corresponding path program 1 times [2022-12-06 07:33:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:13,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981570728] [2022-12-06 07:33:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981570728] [2022-12-06 07:33:13,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981570728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:13,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:13,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:13,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822392997] [2022-12-06 07:33:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:13,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:13,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:13,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:13,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:13,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:13,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:13,958 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:13,958 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:13,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:13,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:13,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:13,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:13,972 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:13,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:14,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:14,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:14,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,034 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:14,034 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:33:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:14,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:14,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:33:14,187 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:14,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2022-12-06 07:33:14,187 INFO L420 AbstractCegarLoop]: === Iteration 827 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash 978703010, now seen corresponding path program 1 times [2022-12-06 07:33:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730440289] [2022-12-06 07:33:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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:33:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730440289] [2022-12-06 07:33:14,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730440289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278845365] [2022-12-06 07:33:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:14,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:14,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:14,539 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:14,539 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:14,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:14,553 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:14,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:14,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:14,554 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:14,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:14,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:14,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:14,590 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:14,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:14,590 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:14,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:14,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,615 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:14,615 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:33:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:14,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:14,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:14,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:14,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:33:14,762 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:14,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:14,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:14,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2022-12-06 07:33:14,762 INFO L420 AbstractCegarLoop]: === Iteration 828 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:14,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1573453951, now seen corresponding path program 1 times [2022-12-06 07:33:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:14,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219659881] [2022-12-06 07:33:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:14,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:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:14,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219659881] [2022-12-06 07:33:14,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219659881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:14,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:14,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398014306] [2022-12-06 07:33:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:14,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:14,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:14,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,098 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:15,098 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:15,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:15,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:15,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:15,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:15,111 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:15,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,145 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:15,145 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:15,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,145 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,170 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:15,171 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:33:15,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:15,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:15,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:33:15,315 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:15,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2022-12-06 07:33:15,315 INFO L420 AbstractCegarLoop]: === Iteration 829 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash 169356384, now seen corresponding path program 1 times [2022-12-06 07:33:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218165572] [2022-12-06 07:33:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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:33:15,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218165572] [2022-12-06 07:33:15,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218165572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774991322] [2022-12-06 07:33:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:15,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:15,678 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:15,678 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:15,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:15,689 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:15,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:15,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:15,690 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:15,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:15,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:15,722 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:15,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:15,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:15,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:15,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,747 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:15,747 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:33:15,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:15,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:15,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:15,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:15,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:33:15,884 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:15,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:15,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:15,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2022-12-06 07:33:15,884 INFO L420 AbstractCegarLoop]: === Iteration 830 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1912166719, now seen corresponding path program 1 times [2022-12-06 07:33:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:15,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394000395] [2022-12-06 07:33:15,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:15,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:15,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:33:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:15,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394000395] [2022-12-06 07:33:15,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394000395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:15,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:15,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33459070] [2022-12-06 07:33:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:15,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:15,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:15,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:15,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:15,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,213 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:16,213 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:16,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:16,227 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:16,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:16,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:16,228 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:16,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:16,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,264 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:16,264 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:16,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,264 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,289 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:16,289 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:16,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:16,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:16,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:33:16,427 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2022-12-06 07:33:16,427 INFO L420 AbstractCegarLoop]: === Iteration 831 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash -639990242, now seen corresponding path program 1 times [2022-12-06 07:33:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759812904] [2022-12-06 07:33:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:16,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:16,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759812904] [2022-12-06 07:33:16,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759812904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:16,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:16,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:16,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499815664] [2022-12-06 07:33:16,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:16,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:16,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:16,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:16,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:16,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:16,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:16,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:16,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:16,766 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:16,766 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:16,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:16,779 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:16,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:16,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:16,780 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:16,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:16,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:16,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:16,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:16,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:16,814 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:16,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:16,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,846 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:16,846 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:16,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:16,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:16,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:16,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:16,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:33:16,991 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:16,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:16,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:16,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2022-12-06 07:33:16,992 INFO L420 AbstractCegarLoop]: === Iteration 832 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1102820093, now seen corresponding path program 1 times [2022-12-06 07:33:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:16,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987430651] [2022-12-06 07:33:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:17,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:33:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987430651] [2022-12-06 07:33:17,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987430651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:17,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550591740] [2022-12-06 07:33:17,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:17,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:17,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,336 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:17,336 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:17,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:17,351 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:17,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:17,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:17,352 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:17,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:17,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:17,388 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:17,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:17,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:17,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:17,388 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:17,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:17,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:17,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:17,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:17,413 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:17,413 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:17,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:17,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:17,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:17,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:17,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 07:33:17,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:17,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:17,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:17,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2022-12-06 07:33:17,660 INFO L420 AbstractCegarLoop]: === Iteration 833 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1449336868, now seen corresponding path program 1 times [2022-12-06 07:33:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:17,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430627252] [2022-12-06 07:33:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:17,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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:33:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:17,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430627252] [2022-12-06 07:33:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430627252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:17,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:17,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316384991] [2022-12-06 07:33:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:17,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:17,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:17,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:17,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:17,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:17,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:17,979 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:17,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:17,993 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:17,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:17,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:17,994 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:17,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:18,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:18,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:18,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,030 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,056 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:18,056 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:33:18,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:18,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:18,192 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:33:18,192 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:18,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2022-12-06 07:33:18,193 INFO L420 AbstractCegarLoop]: === Iteration 834 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 293473467, now seen corresponding path program 1 times [2022-12-06 07:33:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126396487] [2022-12-06 07:33:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,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:33:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126396487] [2022-12-06 07:33:18,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126396487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283715698] [2022-12-06 07:33:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:18,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:18,534 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:18,534 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:18,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:18,549 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:18,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:18,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:18,550 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:18,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:18,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:18,583 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:18,583 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:18,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:18,583 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:18,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:18,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,608 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:18,608 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:33:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:18,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:18,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:18,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:18,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:33:18,750 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:18,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:18,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2022-12-06 07:33:18,751 INFO L420 AbstractCegarLoop]: === Iteration 835 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2036283802, now seen corresponding path program 1 times [2022-12-06 07:33:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:18,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109790888] [2022-12-06 07:33:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:18,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:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109790888] [2022-12-06 07:33:18,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109790888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:18,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110812482] [2022-12-06 07:33:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:18,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:18,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:18,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:18,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:18,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,083 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:19,084 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:33:19,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:19,097 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:19,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:19,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:19,098 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:19,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:19,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,131 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:19,131 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:19,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,131 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,156 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:19,157 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:33:19,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3013 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:19,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:19,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:33:19,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:19,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2022-12-06 07:33:19,292 INFO L420 AbstractCegarLoop]: === Iteration 836 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash -515873159, now seen corresponding path program 1 times [2022-12-06 07:33:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57440951] [2022-12-06 07:33:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,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:33:19,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57440951] [2022-12-06 07:33:19,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57440951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:19,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980892048] [2022-12-06 07:33:19,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:19,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:19,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:19,642 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:19,642 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:19,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:19,653 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:19,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:19,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:19,653 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:19,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:19,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:19,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:19,686 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:19,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:19,686 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:19,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:19,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,711 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:19,711 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:33:19,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:19,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:19,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:19,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:19,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:19,864 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:19,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:19,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:19,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2022-12-06 07:33:19,865 INFO L420 AbstractCegarLoop]: === Iteration 837 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1226937176, now seen corresponding path program 1 times [2022-12-06 07:33:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:19,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818890816] [2022-12-06 07:33:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:19,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:33:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:19,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818890816] [2022-12-06 07:33:19,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818890816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:19,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:19,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619685783] [2022-12-06 07:33:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:19,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:19,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:19,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:19,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:19,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,207 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:20,208 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:20,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:20,221 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:20,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:20,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:20,222 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:20,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:20,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:20,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:20,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,258 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,282 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:20,283 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:33:20,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:20,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:20,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:33:20,423 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:20,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2022-12-06 07:33:20,423 INFO L420 AbstractCegarLoop]: === Iteration 838 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219785, now seen corresponding path program 1 times [2022-12-06 07:33:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279523151] [2022-12-06 07:33:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:20,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:33:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:20,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279523151] [2022-12-06 07:33:20,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279523151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:20,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:20,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11283698] [2022-12-06 07:33:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:20,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:20,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:20,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:20,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:20,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,746 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:20,746 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:20,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:20,760 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:20,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:20,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:20,760 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:20,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:20,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:20,796 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:20,796 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:20,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:20,796 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:20,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:20,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,829 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:20,829 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 07:33:20,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:20,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:20,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:20,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:20,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:20,974 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:20,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:20,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2022-12-06 07:33:20,975 INFO L420 AbstractCegarLoop]: === Iteration 839 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:20,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash 417590550, now seen corresponding path program 1 times [2022-12-06 07:33:20,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:20,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800141704] [2022-12-06 07:33:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:20,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:21,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:33:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800141704] [2022-12-06 07:33:21,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800141704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753267233] [2022-12-06 07:33:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:21,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:21,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:21,303 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:21,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:21,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:21,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:21,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:21,317 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:21,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,350 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,350 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:21,350 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:21,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,350 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,375 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:21,375 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:21,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:21,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:21,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:21,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:33:21,514 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:21,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:21,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:21,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2022-12-06 07:33:21,514 INFO L420 AbstractCegarLoop]: === Iteration 840 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2134566411, now seen corresponding path program 1 times [2022-12-06 07:33:21,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:21,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43084228] [2022-12-06 07:33:21,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:21,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:33:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43084228] [2022-12-06 07:33:21,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43084228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:21,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:21,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125491077] [2022-12-06 07:33:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:21,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:21,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:21,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:21,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:21,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:21,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:21,899 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:21,899 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:21,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:21,916 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:21,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:21,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:21,917 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:21,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:21,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:21,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:21,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:21,955 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:21,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:21,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,980 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:21,980 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:33:21,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:21,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:21,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:22,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:33:22,127 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:22,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2022-12-06 07:33:22,128 INFO L420 AbstractCegarLoop]: === Iteration 841 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -391756076, now seen corresponding path program 1 times [2022-12-06 07:33:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274819926] [2022-12-06 07:33:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:22,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:33:22,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274819926] [2022-12-06 07:33:22,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274819926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079920599] [2022-12-06 07:33:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:22,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:22,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:22,474 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:22,475 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:22,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:22,493 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:22,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:22,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:22,494 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:22,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:22,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:22,533 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:22,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:22,533 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:22,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:22,533 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:22,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:22,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:22,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:22,560 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:22,560 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:33:22,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:22,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:22,563 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:22,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:22,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 07:33:22,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:22,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:22,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:22,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2022-12-06 07:33:22,735 INFO L420 AbstractCegarLoop]: === Iteration 842 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1351054259, now seen corresponding path program 1 times [2022-12-06 07:33:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:22,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129723684] [2022-12-06 07:33:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:22,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:33:22,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:22,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129723684] [2022-12-06 07:33:22,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129723684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:22,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:22,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547773533] [2022-12-06 07:33:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:22,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:22,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:22,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:22,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:22,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:22,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:22,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,078 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:23,078 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:23,092 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:23,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:23,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:23,093 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:23,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:23,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,128 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:23,128 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:23,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,128 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,153 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:23,154 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 07:33:23,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:23,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:23,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:33:23,313 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:23,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2022-12-06 07:33:23,313 INFO L420 AbstractCegarLoop]: === Iteration 843 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1201102702, now seen corresponding path program 1 times [2022-12-06 07:33:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064003040] [2022-12-06 07:33:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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:33:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064003040] [2022-12-06 07:33:23,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064003040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:23,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669422033] [2022-12-06 07:33:23,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:23,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:23,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:23,667 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:23,667 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:23,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:23,678 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:23,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:23,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:23,679 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:23,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:23,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:23,712 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:23,712 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:23,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:23,712 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:23,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:23,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,738 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:23,738 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:23,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2950 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:23,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:23,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:23,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:23,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:33:23,889 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:23,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2022-12-06 07:33:23,889 INFO L420 AbstractCegarLoop]: === Iteration 844 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash 541707633, now seen corresponding path program 1 times [2022-12-06 07:33:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842129395] [2022-12-06 07:33:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:23,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:33:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:23,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842129395] [2022-12-06 07:33:23,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842129395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:23,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:23,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850920839] [2022-12-06 07:33:23,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:23,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:23,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:23,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:23,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:23,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,226 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:24,227 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:24,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:24,240 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:24,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:24,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:24,241 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:24,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:24,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,276 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:24,276 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:24,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,276 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,301 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:24,301 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:33:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:24,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:24,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:24,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:33:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2022-12-06 07:33:24,465 INFO L420 AbstractCegarLoop]: === Iteration 845 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2010449328, now seen corresponding path program 1 times [2022-12-06 07:33:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815010895] [2022-12-06 07:33:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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:33:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815010895] [2022-12-06 07:33:24,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815010895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685817838] [2022-12-06 07:33:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:24,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:24,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:24,796 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:33:24,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:24,812 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:24,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:24,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:24,813 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:24,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:24,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:24,851 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:24,851 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:24,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,851 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,890 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:24,890 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:33:24,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:24,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:24,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:25,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:33:25,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:25,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2022-12-06 07:33:25,038 INFO L420 AbstractCegarLoop]: === Iteration 846 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash -267638993, now seen corresponding path program 1 times [2022-12-06 07:33:25,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365941073] [2022-12-06 07:33:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:25,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365941073] [2022-12-06 07:33:25,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365941073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:25,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139140323] [2022-12-06 07:33:25,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:25,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:25,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,360 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:25,360 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:25,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:25,373 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:25,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:25,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:25,374 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:25,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:25,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,411 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:25,411 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:25,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,411 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,436 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:25,436 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:33:25,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:25,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:25,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:25,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:33:25,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:25,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:25,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:25,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2022-12-06 07:33:25,590 INFO L420 AbstractCegarLoop]: === Iteration 847 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1475171342, now seen corresponding path program 1 times [2022-12-06 07:33:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:25,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195375798] [2022-12-06 07:33:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:25,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:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195375798] [2022-12-06 07:33:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195375798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:25,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:25,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987579173] [2022-12-06 07:33:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:25,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:25,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:25,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:25,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:25,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,932 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:25,932 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:25,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:25,945 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:25,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:25,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:25,946 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:25,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:25,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:25,980 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:25,980 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:25,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,980 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:25,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,006 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:26,006 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:26,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:26,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:26,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:33:26,141 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:26,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2022-12-06 07:33:26,141 INFO L420 AbstractCegarLoop]: === Iteration 848 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1076985619, now seen corresponding path program 1 times [2022-12-06 07:33:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429373015] [2022-12-06 07:33:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,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:26,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429373015] [2022-12-06 07:33:26,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429373015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629070211] [2022-12-06 07:33:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:26,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:26,488 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:26,488 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:26,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:26,502 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:26,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:26,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:26,502 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:26,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:26,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:26,537 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:26,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:26,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:26,538 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:26,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:26,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,563 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:26,563 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:33:26,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:26,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:26,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:26,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:26,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:33:26,707 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:26,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:26,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:26,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2022-12-06 07:33:26,707 INFO L420 AbstractCegarLoop]: === Iteration 849 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash 665824716, now seen corresponding path program 1 times [2022-12-06 07:33:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:26,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160346858] [2022-12-06 07:33:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:26,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:33:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:26,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160346858] [2022-12-06 07:33:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160346858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:26,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:26,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305452670] [2022-12-06 07:33:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:26,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:26,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:26,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:26,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:26,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,062 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:27,063 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:27,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:27,078 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:27,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:27,079 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:27,079 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:27,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:27,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,117 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:27,117 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:27,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,117 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,143 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:27,143 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:33:27,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:27,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:27,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:33:27,286 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:27,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2022-12-06 07:33:27,286 INFO L420 AbstractCegarLoop]: === Iteration 850 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1886332245, now seen corresponding path program 1 times [2022-12-06 07:33:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156216417] [2022-12-06 07:33:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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:33:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156216417] [2022-12-06 07:33:27,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156216417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325687841] [2022-12-06 07:33:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:27,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:27,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:27,636 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:27,637 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:27,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:27,648 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:27,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:27,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:27,649 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:27,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:27,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:27,682 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:27,682 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:27,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:27,682 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:27,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:27,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,707 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:27,707 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:27,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:27,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:27,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:27,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:27,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:33:27,849 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:27,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:27,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:27,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2022-12-06 07:33:27,849 INFO L420 AbstractCegarLoop]: === Iteration 851 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:27,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash -143521910, now seen corresponding path program 1 times [2022-12-06 07:33:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:27,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974247306] [2022-12-06 07:33:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:27,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:33:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:27,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974247306] [2022-12-06 07:33:27,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974247306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:27,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:27,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66982930] [2022-12-06 07:33:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:27,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:27,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:27,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:27,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:27,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,170 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:28,170 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:28,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:28,183 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:28,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:28,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:28,184 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:28,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:28,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,216 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:28,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 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 100 places, 92 transitions, 1195 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,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,242 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:28,242 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:33:28,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:28,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:28,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:33:28,377 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:28,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2022-12-06 07:33:28,377 INFO L420 AbstractCegarLoop]: === Iteration 852 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:28,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1599288425, now seen corresponding path program 1 times [2022-12-06 07:33:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907325954] [2022-12-06 07:33:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:28,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:33:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907325954] [2022-12-06 07:33:28,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907325954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:28,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:28,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702535060] [2022-12-06 07:33:28,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:28,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:28,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:28,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:28,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:28,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:28,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:28,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:28,716 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:33:28,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:28,730 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:28,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:28,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:28,731 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:28,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:28,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:28,785 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:28,785 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:28,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:28,785 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:28,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:28,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,810 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:28,810 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:33:28,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:28,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:28,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:28,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:28,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:33:28,958 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:28,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:28,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:28,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2022-12-06 07:33:28,959 INFO L420 AbstractCegarLoop]: === Iteration 853 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -952868536, now seen corresponding path program 1 times [2022-12-06 07:33:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:28,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330915200] [2022-12-06 07:33:28,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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:33:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330915200] [2022-12-06 07:33:29,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330915200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930961548] [2022-12-06 07:33:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:29,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:29,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:29,303 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:29,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:29,317 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:29,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:29,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:29,318 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:29,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:29,353 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:29,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,353 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,378 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:29,378 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:33:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:29,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:29,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:33:29,526 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:29,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2022-12-06 07:33:29,526 INFO L420 AbstractCegarLoop]: === Iteration 854 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash 789941799, now seen corresponding path program 1 times [2022-12-06 07:33:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645901613] [2022-12-06 07:33:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,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:33:29,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645901613] [2022-12-06 07:33:29,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645901613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730043097] [2022-12-06 07:33:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:29,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:29,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,851 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:29,851 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:29,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:29,865 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:29,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:29,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:29,866 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:29,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:29,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,902 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:29,902 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:29,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,903 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,928 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:29,928 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:33:29,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:29,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:29,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:30,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:33:30,089 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:30,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2022-12-06 07:33:30,090 INFO L420 AbstractCegarLoop]: === Iteration 855 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1762215162, now seen corresponding path program 1 times [2022-12-06 07:33:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404158385] [2022-12-06 07:33:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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:33:30,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404158385] [2022-12-06 07:33:30,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404158385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175090340] [2022-12-06 07:33:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:30,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:30,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,438 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:30,439 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:30,454 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:30,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:30,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:30,454 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:30,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:30,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:30,490 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:30,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:30,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:30,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,490 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:30,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:30,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:30,516 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:30,517 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:30,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:30,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:30,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:30,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:30,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:30,665 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:30,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:30,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:30,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2022-12-06 07:33:30,665 INFO L420 AbstractCegarLoop]: === Iteration 856 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash -19404827, now seen corresponding path program 1 times [2022-12-06 07:33:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:30,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132645997] [2022-12-06 07:33:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:30,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:33:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132645997] [2022-12-06 07:33:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132645997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:30,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848226256] [2022-12-06 07:33:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:30,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:30,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:30,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,997 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:30,997 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:33:31,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:31,010 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:31,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:31,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:31,011 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:31,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:31,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,046 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:31,046 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:31,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,046 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,071 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:31,071 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:33:31,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:31,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:31,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:33:31,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2022-12-06 07:33:31,217 INFO L420 AbstractCegarLoop]: === Iteration 857 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1723405508, now seen corresponding path program 1 times [2022-12-06 07:33:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743627008] [2022-12-06 07:33:31,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,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:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743627008] [2022-12-06 07:33:31,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743627008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650582234] [2022-12-06 07:33:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:31,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:31,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,565 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:31,566 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:33:31,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:31,577 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:31,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:31,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:31,578 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:31,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:31,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:31,608 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:31,608 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:31,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,608 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,633 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:31,633 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:33:31,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:31,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:31,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:31,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:31,786 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:31,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2022-12-06 07:33:31,786 INFO L420 AbstractCegarLoop]: === Iteration 858 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash -828751453, now seen corresponding path program 1 times [2022-12-06 07:33:31,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18545885] [2022-12-06 07:33:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,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:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18545885] [2022-12-06 07:33:31,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18545885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736322416] [2022-12-06 07:33:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:31,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:31,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,107 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:32,107 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:32,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:32,122 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:32,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:32,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:32,123 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:32,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,158 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:32,158 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:32,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,158 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,189 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:32,189 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:32,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:32,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:32,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:33:32,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:32,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2022-12-06 07:33:32,348 INFO L420 AbstractCegarLoop]: === Iteration 859 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 914058882, now seen corresponding path program 1 times [2022-12-06 07:33:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47074276] [2022-12-06 07:33:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:32,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:33:32,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:32,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47074276] [2022-12-06 07:33:32,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47074276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:32,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:32,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010875023] [2022-12-06 07:33:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:32,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:32,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:32,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:32,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:32,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:32,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:32,694 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:32,694 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:32,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:32,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:32,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:32,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:32,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:32,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:32,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:32,759 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:32,759 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:32,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:32,759 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,759 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:32,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:32,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,785 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:32,785 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:32,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:32,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:32,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:32,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:32,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:32,934 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:32,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:32,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:32,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2022-12-06 07:33:32,934 INFO L420 AbstractCegarLoop]: === Iteration 860 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:32,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1638098079, now seen corresponding path program 1 times [2022-12-06 07:33:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:32,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473613218] [2022-12-06 07:33:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:33,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:33:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473613218] [2022-12-06 07:33:33,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473613218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936541041] [2022-12-06 07:33:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:33,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:33,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,282 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:33,282 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:33,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:33,296 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:33,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:33,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:33,296 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:33,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:33,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,331 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:33,331 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:33,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,331 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,357 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:33,357 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:33,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:33,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:33,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:33,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:33:33,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:33,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:33,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:33,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2022-12-06 07:33:33,498 INFO L420 AbstractCegarLoop]: === Iteration 861 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash 104712256, now seen corresponding path program 1 times [2022-12-06 07:33:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:33,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952382170] [2022-12-06 07:33:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:33,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952382170] [2022-12-06 07:33:33,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952382170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:33,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:33,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974423607] [2022-12-06 07:33:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:33,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:33,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:33,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:33,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:33,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:33,839 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:33,839 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:33:33,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:33,852 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:33,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:33,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:33,853 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:33,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:33,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:33,889 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:33,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:33,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:33,890 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:33,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:33,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,915 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:33,915 INFO L131 PetriNetUnfolder]: For 3141/3284 co-relation queries the response was YES. [2022-12-06 07:33:33,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3141/3284 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:33,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:33,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:34,059 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:33:34,060 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:34,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2022-12-06 07:33:34,060 INFO L420 AbstractCegarLoop]: === Iteration 862 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1847522591, now seen corresponding path program 1 times [2022-12-06 07:33:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141027] [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,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,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:33:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141027] [2022-12-06 07:33:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070832082] [2022-12-06 07:33:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:34,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:34,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:34,410 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:34,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13538 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:34,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:34,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:34,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:34,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:34,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:34,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:34,458 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:34,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:34,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:34,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:34,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:34,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:34,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:34,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:34,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:34,484 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:34,484 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:34,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:34,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:34,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:34,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:33:34,624 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:34,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:34,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:34,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2022-12-06 07:33:34,625 INFO L420 AbstractCegarLoop]: === Iteration 863 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash -704634370, now seen corresponding path program 1 times [2022-12-06 07:33:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:34,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230138168] [2022-12-06 07:33:34,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:34,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:33:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:34,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230138168] [2022-12-06 07:33:34,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230138168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:34,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:34,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699642755] [2022-12-06 07:33:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:34,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:34,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:34,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:34,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:34,964 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:34,964 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:33:34,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:34,977 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:34,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:34,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:34,978 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:34,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:35,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:35,015 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:35,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,015 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,040 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:35,040 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:33:35,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:35,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:35,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:33:35,183 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2022-12-06 07:33:35,183 INFO L420 AbstractCegarLoop]: === Iteration 864 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1038175965, now seen corresponding path program 1 times [2022-12-06 07:33:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436001097] [2022-12-06 07:33:35,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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:33:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436001097] [2022-12-06 07:33:35,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436001097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:35,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232893164] [2022-12-06 07:33:35,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:35,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:35,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:35,517 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:35,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:35,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:35,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:35,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:35,530 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:35,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:35,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:35,565 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:35,565 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:35,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:35,566 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:35,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:35,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,592 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:35,592 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:35,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:35,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:35,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:35,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:33:35,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:35,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2022-12-06 07:33:35,744 INFO L420 AbstractCegarLoop]: === Iteration 865 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1513980996, now seen corresponding path program 1 times [2022-12-06 07:33:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652050900] [2022-12-06 07:33:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,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:33:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652050900] [2022-12-06 07:33:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652050900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:35,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:35,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609017196] [2022-12-06 07:33:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:35,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:35,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:35,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:35,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:35,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:35,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,108 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:36,108 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:36,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:36,124 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:36,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:36,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:36,125 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:36,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:36,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,158 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:36,158 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:36,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,158 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,184 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:36,184 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:33:36,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:36,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:36,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:33:36,337 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:36,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2022-12-06 07:33:36,337 INFO L420 AbstractCegarLoop]: === Iteration 866 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 228829339, now seen corresponding path program 1 times [2022-12-06 07:33:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136268305] [2022-12-06 07:33:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,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:33:36,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136268305] [2022-12-06 07:33:36,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136268305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:36,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:36,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:36,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616447927] [2022-12-06 07:33:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:36,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:36,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:36,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:36,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:36,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:36,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:36,701 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:36,701 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:36,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:36,712 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:36,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:36,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:36,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:36,712 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:36,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:36,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:36,741 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:36,741 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:36,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:36,741 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:36,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:36,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,766 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:36,767 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:36,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:36,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:36,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:36,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:36,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:33:36,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:36,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:36,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 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: SelfDestructingSolverStorable865 [2022-12-06 07:33:36,928 INFO L420 AbstractCegarLoop]: === Iteration 867 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1971639674, now seen corresponding path program 1 times [2022-12-06 07:33:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:36,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878022723] [2022-12-06 07:33:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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:33:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878022723] [2022-12-06 07:33:37,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878022723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374272944] [2022-12-06 07:33:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:37,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:37,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,319 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:37,319 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:33:37,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:37,337 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:37,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:37,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:37,338 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:37,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,372 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:37,372 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:37,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,372 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,397 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:37,397 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:33:37,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:37,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:37,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:37,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:33:37,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:37,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:37,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:37,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2022-12-06 07:33:37,553 INFO L420 AbstractCegarLoop]: === Iteration 868 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash -580517287, now seen corresponding path program 1 times [2022-12-06 07:33:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:37,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646326961] [2022-12-06 07:33:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:37,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:33:37,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646326961] [2022-12-06 07:33:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646326961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:37,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:37,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069671874] [2022-12-06 07:33:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:37,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:37,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:37,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:37,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:37,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:37,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:37,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:37,923 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:37,923 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:37,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:37,936 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:37,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:37,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:37,937 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:37,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:37,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:37,973 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:37,973 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:37,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:37,973 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:37,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:37,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:37,998 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:37,999 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:37,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:38,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:38,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:38,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:33:38,149 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2022-12-06 07:33:38,150 INFO L420 AbstractCegarLoop]: === Iteration 869 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1162293048, now seen corresponding path program 1 times [2022-12-06 07:33:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028492556] [2022-12-06 07:33:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028492556] [2022-12-06 07:33:38,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028492556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560192901] [2022-12-06 07:33:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:38,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:38,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:38,487 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:38,488 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:38,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:38,501 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:38,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:38,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:38,502 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:38,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:38,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:38,537 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:38,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:38,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:38,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:38,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:38,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:38,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:38,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:38,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:38,563 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:38,564 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:33:38,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:38,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:38,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:38,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:38,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:33:38,711 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:38,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:38,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2022-12-06 07:33:38,711 INFO L420 AbstractCegarLoop]: === Iteration 870 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1389863913, now seen corresponding path program 1 times [2022-12-06 07:33:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100690179] [2022-12-06 07:33:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:38,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:33:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:38,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100690179] [2022-12-06 07:33:38,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100690179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:38,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:38,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134881373] [2022-12-06 07:33:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:38,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:38,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:38,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:38,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:38,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:38,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:38,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,047 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:39,047 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:39,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:39,062 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:39,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:39,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:39,063 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:39,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,101 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:39,102 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:39,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,102 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,130 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:39,131 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:33:39,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:39,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:39,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:33:39,278 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:39,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2022-12-06 07:33:39,278 INFO L420 AbstractCegarLoop]: === Iteration 871 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash 352946422, now seen corresponding path program 1 times [2022-12-06 07:33:39,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279495795] [2022-12-06 07:33:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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:33:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279495795] [2022-12-06 07:33:39,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279495795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:39,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729157797] [2022-12-06 07:33:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:39,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:39,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,617 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:39,617 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:39,631 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:39,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:39,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:39,632 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:39,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:39,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:39,664 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:39,665 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:39,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,665 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:39,690 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:33:39,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:39,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:39,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:39,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:39,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:33:39,827 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:39,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:39,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:39,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2022-12-06 07:33:39,827 INFO L420 AbstractCegarLoop]: === Iteration 872 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2095756757, now seen corresponding path program 1 times [2022-12-06 07:33:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122141308] [2022-12-06 07:33:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:39,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:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:39,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122141308] [2022-12-06 07:33:39,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122141308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:39,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:39,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72622616] [2022-12-06 07:33:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:39,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:39,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:39,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:40,167 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:40,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:40,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:40,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:40,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:40,181 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:40,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:40,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,215 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:40,215 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:40,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,215 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,216 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,240 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:40,240 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:33:40,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:40,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:40,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:33:40,394 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:40,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2022-12-06 07:33:40,394 INFO L420 AbstractCegarLoop]: === Iteration 873 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash -456400204, now seen corresponding path program 1 times [2022-12-06 07:33:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607358259] [2022-12-06 07:33:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:40,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607358259] [2022-12-06 07:33:40,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607358259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:40,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:40,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595302346] [2022-12-06 07:33:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:40,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:40,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:40,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:40,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:40,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:40,761 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:33:40,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:40,772 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:40,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:40,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:40,773 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:40,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:40,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:40,802 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:40,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:40,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:40,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:40,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:40,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,827 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:40,827 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:33:40,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:40,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:40,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:40,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:40,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:33:40,963 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:40,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:40,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:40,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2022-12-06 07:33:40,963 INFO L420 AbstractCegarLoop]: === Iteration 874 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1286410131, now seen corresponding path program 1 times [2022-12-06 07:33:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:40,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371734094] [2022-12-06 07:33:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,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:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371734094] [2022-12-06 07:33:41,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371734094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:41,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886343437] [2022-12-06 07:33:41,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:41,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:41,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,302 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:41,302 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:41,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:41,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:41,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:41,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:41,317 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:41,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:41,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,351 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:41,352 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:41,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,352 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,352 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,377 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:41,377 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:33:41,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:41,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:41,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:41,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:33:41,525 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:41,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:41,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:41,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2022-12-06 07:33:41,526 INFO L420 AbstractCegarLoop]: === Iteration 875 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1265746830, now seen corresponding path program 1 times [2022-12-06 07:33:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:41,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804805835] [2022-12-06 07:33:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:41,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804805835] [2022-12-06 07:33:41,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804805835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:41,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:41,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860982050] [2022-12-06 07:33:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:41,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:41,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:41,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:41,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:41,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:41,845 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:41,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:41,858 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:41,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:41,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:41,859 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:41,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:41,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:41,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:41,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:41,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:41,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:41,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:41,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,924 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:41,924 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:41,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:41,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:41,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:42,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:42,071 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:42,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2022-12-06 07:33:42,071 INFO L420 AbstractCegarLoop]: === Iteration 876 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash 477063505, now seen corresponding path program 1 times [2022-12-06 07:33:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950589579] [2022-12-06 07:33:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:42,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:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950589579] [2022-12-06 07:33:42,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950589579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465709605] [2022-12-06 07:33:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:42,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:42,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:42,425 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:42,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:42,439 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:42,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:42,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:42,440 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:42,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:42,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:42,475 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:42,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:42,475 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:42,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:42,475 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:42,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:42,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:42,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:42,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:42,500 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:42,501 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:33:42,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:42,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:42,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:42,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:42,642 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:33:42,642 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:42,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:42,642 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:42,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2022-12-06 07:33:42,643 INFO L420 AbstractCegarLoop]: === Iteration 877 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2075093456, now seen corresponding path program 1 times [2022-12-06 07:33:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:42,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893028234] [2022-12-06 07:33:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33: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:33:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:42,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893028234] [2022-12-06 07:33:42,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893028234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:42,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:42,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085665621] [2022-12-06 07:33:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:42,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:42,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:42,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:42,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:42,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:42,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:42,989 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:42,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:43,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:43,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:43,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:43,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:43,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:43,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,045 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:43,045 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:43,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,045 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,071 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:43,071 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:33:43,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:43,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:43,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:43,220 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:43,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2022-12-06 07:33:43,220 INFO L420 AbstractCegarLoop]: === Iteration 878 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -332283121, now seen corresponding path program 1 times [2022-12-06 07:33:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626606315] [2022-12-06 07:33:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,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:33:43,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626606315] [2022-12-06 07:33:43,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626606315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:43,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999523154] [2022-12-06 07:33:43,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:43,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:43,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:43,597 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:43,597 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:33:43,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:43,614 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:43,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:43,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:43,615 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:43,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:43,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:43,650 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:43,651 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:43,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:43,651 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:43,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:43,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,676 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:43,676 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:33:43,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:43,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:43,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:43,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:43,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 07:33:43,807 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:43,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:43,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:43,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2022-12-06 07:33:43,807 INFO L420 AbstractCegarLoop]: === Iteration 879 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1410527214, now seen corresponding path program 1 times [2022-12-06 07:33:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266997211] [2022-12-06 07:33:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:43,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:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:43,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266997211] [2022-12-06 07:33:43,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266997211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:43,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:43,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672578362] [2022-12-06 07:33:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:43,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:43,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:43,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:43,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:43,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:43,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,146 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:44,146 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:33:44,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:44,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:44,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:44,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:44,160 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:44,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,192 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:44,193 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:44,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,193 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,217 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:44,218 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:33:44,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:44,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:44,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:44,368 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:44,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2022-12-06 07:33:44,368 INFO L420 AbstractCegarLoop]: === Iteration 880 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1141629747, now seen corresponding path program 1 times [2022-12-06 07:33:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901375948] [2022-12-06 07:33:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,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:33:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901375948] [2022-12-06 07:33:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901375948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486266086] [2022-12-06 07:33:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:44,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:44,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:44,713 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:44,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:44,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:44,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:44,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:44,725 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:44,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:44,756 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:44,756 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:44,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:44,756 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:44,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:44,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,781 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:44,781 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:33:44,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:44,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:44,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:44,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:44,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:33:44,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:44,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:44,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:44,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2022-12-06 07:33:44,928 INFO L420 AbstractCegarLoop]: === Iteration 881 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 601180588, now seen corresponding path program 1 times [2022-12-06 07:33:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934669199] [2022-12-06 07:33:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:44,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934669199] [2022-12-06 07:33:44,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934669199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:44,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:44,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704574091] [2022-12-06 07:33:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:44,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:44,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:44,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:44,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,268 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:45,268 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:45,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:45,282 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:45,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:45,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:45,283 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:45,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:45,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,318 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:45,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:45,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,319 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,344 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:45,344 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:33:45,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:45,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:45,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:45,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:33:45,500 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:45,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:45,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2022-12-06 07:33:45,500 INFO L420 AbstractCegarLoop]: === Iteration 882 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1950976373, now seen corresponding path program 1 times [2022-12-06 07:33:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:45,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640291609] [2022-12-06 07:33:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:45,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:45,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:45,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640291609] [2022-12-06 07:33:45,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640291609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:45,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:45,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:45,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107332596] [2022-12-06 07:33:45,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:45,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:45,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:45,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:45,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:45,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:45,833 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:45,833 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:45,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:45,847 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:45,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:45,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:45,848 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:45,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:45,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:45,903 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:45,903 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:45,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:45,903 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:45,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:45,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,929 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:45,929 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:45,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:45,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:46,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:33:46,068 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:46,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2022-12-06 07:33:46,068 INFO L420 AbstractCegarLoop]: === Iteration 883 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash -208166038, now seen corresponding path program 1 times [2022-12-06 07:33:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473981772] [2022-12-06 07:33:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473981772] [2022-12-06 07:33:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473981772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267103321] [2022-12-06 07:33:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:46,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:46,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,383 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:46,383 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:46,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:46,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:46,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:46,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:46,397 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:46,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:46,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:46,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:46,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,433 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,457 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:46,457 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:33:46,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:46,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:46,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:46,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:33:46,593 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2022-12-06 07:33:46,593 INFO L420 AbstractCegarLoop]: === Iteration 884 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1534644297, now seen corresponding path program 1 times [2022-12-06 07:33:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139489510] [2022-12-06 07:33:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:46,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:33:46,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:46,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139489510] [2022-12-06 07:33:46,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139489510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:46,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:46,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763417871] [2022-12-06 07:33:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:46,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:46,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:46,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:46,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:46,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:46,933 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:46,933 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:33:46,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:46,946 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:46,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:46,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:46,947 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:46,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:46,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:46,984 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:46,984 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:46,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:46,984 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:46,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:46,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,009 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:47,009 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:47,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:47,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:47,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:33:47,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:47,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2022-12-06 07:33:47,152 INFO L420 AbstractCegarLoop]: === Iteration 885 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1017512664, now seen corresponding path program 1 times [2022-12-06 07:33:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252422835] [2022-12-06 07:33:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,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:33:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252422835] [2022-12-06 07:33:47,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252422835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398503330] [2022-12-06 07:33:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:47,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:47,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,509 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:47,509 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:33:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:47,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:47,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:47,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:47,523 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:47,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:47,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:47,560 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:47,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,560 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,585 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:47,585 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 07:33:47,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3174/3317 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:47,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:47,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:47,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:47,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:47,735 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:47,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2022-12-06 07:33:47,735 INFO L420 AbstractCegarLoop]: === Iteration 886 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 725297671, now seen corresponding path program 1 times [2022-12-06 07:33:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443198984] [2022-12-06 07:33:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,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:33:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443198984] [2022-12-06 07:33:47,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443198984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:47,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253954533] [2022-12-06 07:33:47,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:47,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:47,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,077 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:48,077 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:33:48,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13503 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:48,091 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:48,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:48,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:48,092 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:48,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,136 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:48,136 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:48,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,136 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,161 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:48,161 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:48,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:48,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:48,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:33:48,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:48,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2022-12-06 07:33:48,308 INFO L420 AbstractCegarLoop]: === Iteration 887 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1826859290, now seen corresponding path program 1 times [2022-12-06 07:33:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260786571] [2022-12-06 07:33:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260786571] [2022-12-06 07:33:48,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260786571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:48,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499526048] [2022-12-06 07:33:48,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:48,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:48,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,659 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:48,659 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:48,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:48,672 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:48,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:48,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:48,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:48,672 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:48,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:48,704 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:48,704 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:48,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,704 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,729 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:48,729 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:48,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:48,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:48,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:48,864 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:48,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:33:48,865 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:48,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2022-12-06 07:33:48,865 INFO L420 AbstractCegarLoop]: === Iteration 888 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -84048955, now seen corresponding path program 1 times [2022-12-06 07:33:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58476361] [2022-12-06 07:33:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:48,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:33:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:48,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58476361] [2022-12-06 07:33:48,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58476361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:48,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:48,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726961235] [2022-12-06 07:33:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:48,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:48,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:48,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:48,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:48,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,204 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:49,205 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:49,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:49,217 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:49,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:49,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:49,218 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:49,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:49,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,252 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:49,252 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:49,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,252 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,277 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:49,277 INFO L131 PetriNetUnfolder]: For 3112/3253 co-relation queries the response was YES. [2022-12-06 07:33:49,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3112/3253 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:49,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:49,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:33:49,416 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:49,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2022-12-06 07:33:49,416 INFO L420 AbstractCegarLoop]: === Iteration 889 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1658761380, now seen corresponding path program 1 times [2022-12-06 07:33:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792262078] [2022-12-06 07:33:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,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:33:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792262078] [2022-12-06 07:33:49,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792262078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:49,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735670750] [2022-12-06 07:33:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:49,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:49,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:49,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:49,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:49,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:49,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:49,756 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:49,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:49,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:49,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:49,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:49,767 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:49,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:49,798 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,798 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:49,798 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:49,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:49,798 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:49,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:49,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,824 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:49,824 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:33:49,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:49,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:49,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:49,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:49,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:33:49,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:49,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:49,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:49,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2022-12-06 07:33:49,966 INFO L420 AbstractCegarLoop]: === Iteration 890 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:49,966 INFO L85 PathProgramCache]: Analyzing trace with hash -893395581, now seen corresponding path program 1 times [2022-12-06 07:33:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:49,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025791974] [2022-12-06 07:33:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,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:33:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025791974] [2022-12-06 07:33:50,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025791974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215446885] [2022-12-06 07:33:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:50,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:50,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:50,308 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:50,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:50,320 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:50,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:50,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:50,321 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:50,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:50,355 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:50,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,355 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,379 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:50,380 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:33:50,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:50,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:50,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:50,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:33:50,524 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:50,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:50,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:50,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2022-12-06 07:33:50,525 INFO L420 AbstractCegarLoop]: === Iteration 891 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 849414754, now seen corresponding path program 1 times [2022-12-06 07:33:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:50,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37519167] [2022-12-06 07:33:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:50,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:33:50,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:50,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37519167] [2022-12-06 07:33:50,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37519167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:50,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:50,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:50,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045863574] [2022-12-06 07:33:50,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:50,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:50,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:50,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:50,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:50,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:50,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:50,855 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:50,855 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:33:50,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:50,869 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:50,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:50,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:50,870 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:50,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:50,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:50,907 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:50,907 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:50,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:50,907 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:50,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:50,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,932 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:50,932 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:33:50,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:50,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:50,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:51,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:51,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:33:51,081 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:51,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:51,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:51,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2022-12-06 07:33:51,081 INFO L420 AbstractCegarLoop]: === Iteration 892 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1702742207, now seen corresponding path program 1 times [2022-12-06 07:33:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:51,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147035781] [2022-12-06 07:33:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,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:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147035781] [2022-12-06 07:33:51,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147035781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786116633] [2022-12-06 07:33:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:51,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:51,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:51,413 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:51,413 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:51,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:51,427 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:51,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:51,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:51,427 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:51,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:51,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:51,463 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:51,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:51,463 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:51,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:51,463 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:51,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:51,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:51,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:51,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:51,488 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:51,489 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:33:51,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:51,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:51,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:51,638 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:51,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:51,639 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:51,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:51,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:51,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2022-12-06 07:33:51,639 INFO L420 AbstractCegarLoop]: === Iteration 893 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash 40068128, now seen corresponding path program 1 times [2022-12-06 07:33:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:51,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632068807] [2022-12-06 07:33:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:51,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632068807] [2022-12-06 07:33:51,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632068807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:51,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:51,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570752565] [2022-12-06 07:33:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:51,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:51,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:51,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:51,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:51,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,034 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:52,034 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:33:52,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:52,054 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:52,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:52,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:52,055 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:52,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:52,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,093 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:52,093 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:52,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,093 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,118 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:52,118 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:33:52,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:52,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:52,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:33:52,258 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:52,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2022-12-06 07:33:52,258 INFO L420 AbstractCegarLoop]: === Iteration 894 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1782878463, now seen corresponding path program 1 times [2022-12-06 07:33:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887229809] [2022-12-06 07:33:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,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:33:52,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887229809] [2022-12-06 07:33:52,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887229809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123221184] [2022-12-06 07:33:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:52,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:52,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:52,612 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:52,612 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:52,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:52,624 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:52,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:52,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:52,625 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:52,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:52,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:52,659 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:52,659 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:52,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:52,659 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:52,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:52,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,684 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:52,685 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:33:52,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:52,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:52,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:52,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:52,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:33:52,825 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:52,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:52,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:52,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2022-12-06 07:33:52,825 INFO L420 AbstractCegarLoop]: === Iteration 895 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -769278498, now seen corresponding path program 1 times [2022-12-06 07:33:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:52,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107079123] [2022-12-06 07:33:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:52,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:33:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:52,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107079123] [2022-12-06 07:33:52,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107079123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:52,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:52,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362306804] [2022-12-06 07:33:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:52,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:52,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:52,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:52,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:52,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,151 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:53,151 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:53,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:53,165 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:53,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:53,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:53,166 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:53,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:53,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,203 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:53,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:53,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,229 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:53,229 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:53,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:53,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:53,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:33:53,368 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:53,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2022-12-06 07:33:53,368 INFO L420 AbstractCegarLoop]: === Iteration 896 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 973531837, now seen corresponding path program 1 times [2022-12-06 07:33:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115443765] [2022-12-06 07:33:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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:33:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115443765] [2022-12-06 07:33:53,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115443765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646498784] [2022-12-06 07:33:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:53,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:53,718 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:53,718 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:33:53,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:53,729 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:53,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:53,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:53,730 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:53,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:53,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:53,760 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:53,760 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:53,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:53,760 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:53,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:53,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,785 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:53,785 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:33:53,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:53,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:53,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:53,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:53,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:33:53,926 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:53,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:53,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:53,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2022-12-06 07:33:53,926 INFO L420 AbstractCegarLoop]: === Iteration 897 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:53,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1578625124, now seen corresponding path program 1 times [2022-12-06 07:33:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:53,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734687664] [2022-12-06 07:33:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:53,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:33:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:53,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734687664] [2022-12-06 07:33:53,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734687664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:53,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:53,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221731150] [2022-12-06 07:33:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:53,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:53,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:53,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:53,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,282 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:54,282 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:54,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:54,297 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:54,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:54,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:54,297 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:54,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:54,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,336 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:54,336 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:54,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,336 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,369 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:54,369 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:33:54,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:54,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:54,513 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:54,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:54,514 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:54,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:54,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:54,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2022-12-06 07:33:54,514 INFO L420 AbstractCegarLoop]: === Iteration 898 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash 164185211, now seen corresponding path program 1 times [2022-12-06 07:33:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:54,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234988598] [2022-12-06 07:33:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:54,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:33:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:54,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234988598] [2022-12-06 07:33:54,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234988598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:54,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:54,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109083681] [2022-12-06 07:33:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:54,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:54,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:54,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:54,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:54,860 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:54,860 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:33:54,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:54,874 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:54,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:54,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:54,875 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:54,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:54,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:54,908 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:54,909 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:54,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:54,909 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:54,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:54,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,942 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:54,942 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:33:54,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:54,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:54,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:55,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:55,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:33:55,075 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:55,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:55,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:55,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2022-12-06 07:33:55,075 INFO L420 AbstractCegarLoop]: === Iteration 899 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:55,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:55,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1906995546, now seen corresponding path program 1 times [2022-12-06 07:33:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:55,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050685512] [2022-12-06 07:33:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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:33:55,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050685512] [2022-12-06 07:33:55,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050685512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719365866] [2022-12-06 07:33:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:55,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:55,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,400 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:55,401 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:55,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:55,414 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:55,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:55,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:55,415 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:55,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:55,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:55,448 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:55,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:55,449 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:55,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,449 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:55,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:55,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:55,473 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:55,473 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:33:55,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:55,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:55,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:55,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:55,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:33:55,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:55,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:55,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:55,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2022-12-06 07:33:55,613 INFO L420 AbstractCegarLoop]: === Iteration 900 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -645161415, now seen corresponding path program 1 times [2022-12-06 07:33:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907577952] [2022-12-06 07:33:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:55,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:33:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:55,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907577952] [2022-12-06 07:33:55,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907577952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:55,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:55,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116483016] [2022-12-06 07:33:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:55,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:55,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:55,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:55,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:55,972 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:33:55,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:55,988 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:55,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:55,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:55,989 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:55,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:56,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,025 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:56,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:56,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,051 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:56,051 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:56,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:56,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:56,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:56,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:56,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2022-12-06 07:33:56,203 INFO L420 AbstractCegarLoop]: === Iteration 901 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1097648920, now seen corresponding path program 1 times [2022-12-06 07:33:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915499179] [2022-12-06 07:33:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915499179] [2022-12-06 07:33:56,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915499179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759103356] [2022-12-06 07:33:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:56,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:56,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:56,552 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:56,552 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:56,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:56,564 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:56,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:56,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:56,565 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:56,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:56,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:56,599 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:56,599 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:56,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:56,599 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:56,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:56,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,624 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:56,624 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:33:56,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:56,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:56,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:56,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:56,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:33:56,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:56,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:56,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:56,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2022-12-06 07:33:56,778 INFO L420 AbstractCegarLoop]: === Iteration 902 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1454508041, now seen corresponding path program 1 times [2022-12-06 07:33:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:56,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838456773] [2022-12-06 07:33:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:56,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:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838456773] [2022-12-06 07:33:56,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838456773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:56,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:56,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830057748] [2022-12-06 07:33:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:56,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:56,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:56,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:56,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:56,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,122 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:57,122 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:57,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:57,134 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:57,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:57,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:57,135 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:57,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:57,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,170 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:57,170 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:57,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,170 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,195 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:57,195 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:33:57,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:57,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:57,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:33:57,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:57,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2022-12-06 07:33:57,345 INFO L420 AbstractCegarLoop]: === Iteration 903 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 288302294, now seen corresponding path program 1 times [2022-12-06 07:33:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211205791] [2022-12-06 07:33:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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:33:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211205791] [2022-12-06 07:33:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211205791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069417348] [2022-12-06 07:33:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:57,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:57,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:57,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:57,695 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:57,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:57,707 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:57,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:57,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:57,708 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:57,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:57,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:57,738 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:57,738 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:57,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:57,738 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:57,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:57,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,763 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:57,763 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:33:57,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:57,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:57,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:57,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:57,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:33:57,907 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:57,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:57,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:57,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2022-12-06 07:33:57,907 INFO L420 AbstractCegarLoop]: === Iteration 904 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2031112629, now seen corresponding path program 1 times [2022-12-06 07:33:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14812415] [2022-12-06 07:33:57,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:57,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:33:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:57,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14812415] [2022-12-06 07:33:57,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14812415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:57,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:57,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50111347] [2022-12-06 07:33:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:57,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:57,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:57,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:57,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:57,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:57,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,220 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:58,220 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:58,234 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:58,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:58,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:58,235 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:58,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:58,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,271 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:58,271 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:58,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,271 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,296 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:58,296 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:33:58,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:58,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:58,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:58,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:33:58,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:58,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:58,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2022-12-06 07:33:58,434 INFO L420 AbstractCegarLoop]: === Iteration 905 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -521044332, now seen corresponding path program 1 times [2022-12-06 07:33:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:58,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173271236] [2022-12-06 07:33:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:58,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:33:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173271236] [2022-12-06 07:33:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173271236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:58,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:58,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779241997] [2022-12-06 07:33:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:58,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:58,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:58,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:58,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:58,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:58,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:58,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:58,796 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:33:58,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:58,809 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:58,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:58,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:58,810 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:58,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:58,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:58,867 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:58,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:58,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:58,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:58,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:58,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,893 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:58,893 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:33:58,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:33:58,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:58,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:59,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:33:59,041 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:59,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2022-12-06 07:33:59,041 INFO L420 AbstractCegarLoop]: === Iteration 906 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1221766003, now seen corresponding path program 1 times [2022-12-06 07:33:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662020612] [2022-12-06 07:33:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662020612] [2022-12-06 07:33:59,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662020612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421889454] [2022-12-06 07:33:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:59,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:59,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,382 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:59,382 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:33:59,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:59,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:59,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:59,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:59,397 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:59,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:59,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,435 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:59,435 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:59,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,436 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,461 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:33:59,461 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:33:59,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:33:59,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:33:59,599 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:59,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:33:59,599 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:33:59,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:59,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:59,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2022-12-06 07:33:59,600 INFO L420 AbstractCegarLoop]: === Iteration 907 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1330390958, now seen corresponding path program 1 times [2022-12-06 07:33:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:59,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919484986] [2022-12-06 07:33:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:59,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:33:59,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919484986] [2022-12-06 07:33:59,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919484986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:59,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:59,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:33:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269030325] [2022-12-06 07:33:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:59,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:59,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:59,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:59,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:33:59,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:59,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:33:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:59,925 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:33:59,925 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:33:59,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:33:59,938 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:33:59,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:33:59,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:33:59,939 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:33:59,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:33:59,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:59,973 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:33:59,973 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:33:59,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:59,973 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:59,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:59,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:33:59,998 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:33:59,998 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:33:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:00,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:00,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:00,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:34:00,140 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:00,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2022-12-06 07:34:00,141 INFO L420 AbstractCegarLoop]: === Iteration 908 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash 412419377, now seen corresponding path program 1 times [2022-12-06 07:34:00,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329588767] [2022-12-06 07:34:00,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,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:34:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329588767] [2022-12-06 07:34:00,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329588767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506363697] [2022-12-06 07:34:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:00,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:00,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:00,491 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:00,492 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:00,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:00,504 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:00,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:00,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:00,505 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:00,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:00,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:00,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:00,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:00,540 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:00,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:00,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:00,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:00,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:00,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:00,565 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:00,565 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:34:00,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:00,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:00,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:00,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:00,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:34:00,717 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:00,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:00,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:00,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2022-12-06 07:34:00,717 INFO L420 AbstractCegarLoop]: === Iteration 909 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2139737584, now seen corresponding path program 1 times [2022-12-06 07:34:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:00,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177036351] [2022-12-06 07:34:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:00,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:00,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:00,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177036351] [2022-12-06 07:34:00,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177036351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:00,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:00,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318441878] [2022-12-06 07:34:00,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:00,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:00,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:00,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:00,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:00,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:00,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:00,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,041 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:01,041 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:01,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:01,054 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:01,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:01,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:01,055 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:01,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:01,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,089 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:01,089 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:01,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,090 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,115 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:01,115 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:34:01,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:01,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:01,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:34:01,249 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:01,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2022-12-06 07:34:01,249 INFO L420 AbstractCegarLoop]: === Iteration 910 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -396927249, now seen corresponding path program 1 times [2022-12-06 07:34:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875798994] [2022-12-06 07:34:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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:34:01,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875798994] [2022-12-06 07:34:01,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875798994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281418946] [2022-12-06 07:34:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:01,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:01,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:01,585 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:01,585 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:01,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:01,597 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:01,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:01,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:01,598 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:01,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:01,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,632 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:01,632 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:01,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,632 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,657 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:01,657 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:01,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:01,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:01,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:01,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:01,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:34:01,798 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2022-12-06 07:34:01,798 INFO L420 AbstractCegarLoop]: === Iteration 911 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1345883086, now seen corresponding path program 1 times [2022-12-06 07:34:01,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:01,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315437748] [2022-12-06 07:34:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:01,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:01,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:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:01,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315437748] [2022-12-06 07:34:01,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315437748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:01,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:01,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984944528] [2022-12-06 07:34:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:01,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:01,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:01,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:01,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:01,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,138 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:02,138 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:02,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:02,151 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:02,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:02,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:02,152 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:02,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:02,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,189 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:02,189 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:02,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,189 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,214 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:02,215 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:02,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:02,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:02,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:34:02,361 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2022-12-06 07:34:02,361 INFO L420 AbstractCegarLoop]: === Iteration 912 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1206273875, now seen corresponding path program 1 times [2022-12-06 07:34:02,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574052184] [2022-12-06 07:34:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574052184] [2022-12-06 07:34:02,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574052184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248875281] [2022-12-06 07:34:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:02,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:02,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:02,727 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:02,727 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:02,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13525 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:02,737 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:02,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:02,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:02,738 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:02,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:02,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:02,768 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:02,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:02,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:02,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:02,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:02,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,794 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:02,795 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:34:02,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:02,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:02,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:02,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:02,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:34:02,929 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:02,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:02,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:02,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2022-12-06 07:34:02,929 INFO L420 AbstractCegarLoop]: === Iteration 913 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 536536460, now seen corresponding path program 1 times [2022-12-06 07:34:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101910516] [2022-12-06 07:34:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,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:02,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101910516] [2022-12-06 07:34:02,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101910516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:02,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:02,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643670931] [2022-12-06 07:34:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:02,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:02,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:02,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:02,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:02,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:02,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:03,267 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:03,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:03,281 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:03,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:03,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:03,282 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:03,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:03,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,317 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:03,317 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:03,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,317 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:03,347 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:34:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:03,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:03,503 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:03,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:34:03,504 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:03,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:03,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:03,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2022-12-06 07:34:03,504 INFO L420 AbstractCegarLoop]: === Iteration 914 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2015620501, now seen corresponding path program 1 times [2022-12-06 07:34:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:03,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755536953] [2022-12-06 07:34:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:03,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:03,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:03,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755536953] [2022-12-06 07:34:03,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755536953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:03,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:03,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898567671] [2022-12-06 07:34:03,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:03,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:03,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:03,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:03,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:03,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:03,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:03,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:03,846 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:03,846 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:34:03,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13528 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:03,861 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:03,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:03,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:03,862 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:03,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:03,896 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:03,897 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:03,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:03,897 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:03,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:03,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,922 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:03,922 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:34:03,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:03,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:03,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:04,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:04,061 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:04,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2022-12-06 07:34:04,061 INFO L420 AbstractCegarLoop]: === Iteration 915 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -272810166, now seen corresponding path program 1 times [2022-12-06 07:34:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243087706] [2022-12-06 07:34:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243087706] [2022-12-06 07:34:04,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243087706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229809837] [2022-12-06 07:34:04,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:04,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:04,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,412 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:04,412 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:04,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:04,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:04,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:04,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:04,432 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:04,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:04,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:04,471 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:04,471 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:04,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:04,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:04,472 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:04,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:04,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:04,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:04,503 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:04,503 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:04,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:04,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:04,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:04,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:04,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:34:04,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:04,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:04,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:04,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2022-12-06 07:34:04,644 INFO L420 AbstractCegarLoop]: === Iteration 916 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:04,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1470000169, now seen corresponding path program 1 times [2022-12-06 07:34:04,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:04,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610737429] [2022-12-06 07:34:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:04,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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:34:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:04,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610737429] [2022-12-06 07:34:04,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610737429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:04,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:04,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:04,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554209937] [2022-12-06 07:34:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:04,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:04,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:04,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:04,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:04,983 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:04,983 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:04,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13502 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:04,996 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:04,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:04,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:04,997 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:04,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:05,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,035 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:05,035 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:05,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,035 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,060 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:05,060 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:05,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:05,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:05,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:34:05,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:05,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2022-12-06 07:34:05,202 INFO L420 AbstractCegarLoop]: === Iteration 917 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1082156792, now seen corresponding path program 1 times [2022-12-06 07:34:05,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783374305] [2022-12-06 07:34:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,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:34:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783374305] [2022-12-06 07:34:05,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783374305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755273842] [2022-12-06 07:34:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:05,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:05,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,546 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:05,546 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:05,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:05,559 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:05,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:05,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:05,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:05,560 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:05,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:05,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:05,594 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:05,594 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:05,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,594 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,620 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:05,620 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:34:05,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:05,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:05,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:05,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:05,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:34:05,758 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:05,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:05,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:05,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2022-12-06 07:34:05,758 INFO L420 AbstractCegarLoop]: === Iteration 918 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash 660653543, now seen corresponding path program 1 times [2022-12-06 07:34:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127398284] [2022-12-06 07:34:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127398284] [2022-12-06 07:34:05,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127398284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:05,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:05,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509652703] [2022-12-06 07:34:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:05,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:05,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:05,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:05,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,105 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:06,106 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:06,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:06,119 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:06,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:06,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:06,120 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:06,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:06,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,155 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:06,155 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:06,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,155 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,180 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:06,180 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:06,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:06,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:34:06,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2022-12-06 07:34:06,322 INFO L420 AbstractCegarLoop]: === Iteration 919 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1891503418, now seen corresponding path program 1 times [2022-12-06 07:34:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923734356] [2022-12-06 07:34:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923734356] [2022-12-06 07:34:06,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923734356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:06,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525556915] [2022-12-06 07:34:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:06,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:06,672 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:06,673 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:34:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:06,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:06,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:06,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:06,684 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:06,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:06,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:06,721 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:06,721 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:06,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:06,721 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:06,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:06,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,746 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:06,746 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:06,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:06,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:06,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:06,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:06,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:34:06,900 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:06,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:06,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:06,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2022-12-06 07:34:06,901 INFO L420 AbstractCegarLoop]: === Iteration 920 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -148693083, now seen corresponding path program 1 times [2022-12-06 07:34:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:06,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876564900] [2022-12-06 07:34:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:06,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:34:06,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876564900] [2022-12-06 07:34:06,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876564900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:06,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:06,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:06,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231881284] [2022-12-06 07:34:06,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:06,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:06,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:06,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:06,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:06,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,229 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:07,229 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:07,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:07,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:07,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:07,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:07,244 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:07,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:07,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,279 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:07,279 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:07,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,280 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,304 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:07,304 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:07,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:07,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:07,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:07,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:34:07,453 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:07,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:07,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:07,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2022-12-06 07:34:07,453 INFO L420 AbstractCegarLoop]: === Iteration 921 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1594117252, now seen corresponding path program 1 times [2022-12-06 07:34:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:07,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79139404] [2022-12-06 07:34:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:07,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:34:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:07,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79139404] [2022-12-06 07:34:07,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79139404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:07,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:07,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099966479] [2022-12-06 07:34:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:07,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:07,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:07,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:07,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:07,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:07,795 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:07,796 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:07,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:07,812 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:07,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:07,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:07,813 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:07,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:07,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:07,849 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:07,849 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:07,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:07,849 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:07,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:07,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,884 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:07,884 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:34:07,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:07,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:07,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:08,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:34:08,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:08,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2022-12-06 07:34:08,038 INFO L420 AbstractCegarLoop]: === Iteration 922 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash -958039709, now seen corresponding path program 1 times [2022-12-06 07:34:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274609447] [2022-12-06 07:34:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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:08,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274609447] [2022-12-06 07:34:08,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274609447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985988812] [2022-12-06 07:34:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:08,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:08,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,398 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:08,398 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:08,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:08,414 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:08,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:08,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:08,415 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:08,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:08,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:08,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:08,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:08,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:08,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:08,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:08,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:08,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:08,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:08,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:08,480 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:08,480 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:34:08,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:08,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:08,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:08,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:08,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:34:08,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:08,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:08,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:08,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2022-12-06 07:34:08,623 INFO L420 AbstractCegarLoop]: === Iteration 923 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 784770626, now seen corresponding path program 1 times [2022-12-06 07:34:08,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:08,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169828443] [2022-12-06 07:34:08,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:08,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:08,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:08,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169828443] [2022-12-06 07:34:08,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169828443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:08,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:08,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062609041] [2022-12-06 07:34:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:08,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:08,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:08,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:08,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:08,966 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:08,966 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:08,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:08,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:08,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:08,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:08,980 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:08,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:09,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,017 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:09,017 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:09,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,017 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,042 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:09,043 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:34:09,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:09,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:09,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:34:09,194 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:09,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2022-12-06 07:34:09,194 INFO L420 AbstractCegarLoop]: === Iteration 924 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1767386335, now seen corresponding path program 1 times [2022-12-06 07:34:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172679444] [2022-12-06 07:34:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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:34:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172679444] [2022-12-06 07:34:09,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172679444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933295144] [2022-12-06 07:34:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:09,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:09,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:09,562 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:09,562 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:09,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:09,575 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:09,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:09,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:09,576 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:09,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:09,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:09,612 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:09,612 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:09,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:09,612 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:09,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:09,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,637 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:09,637 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:09,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:09,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:09,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:09,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:09,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:34:09,779 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:09,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:09,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:09,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2022-12-06 07:34:09,779 INFO L420 AbstractCegarLoop]: === Iteration 925 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -24576000, now seen corresponding path program 1 times [2022-12-06 07:34:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:09,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118555727] [2022-12-06 07:34:09,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:09,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:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:09,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118555727] [2022-12-06 07:34:09,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118555727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:09,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:09,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801937718] [2022-12-06 07:34:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:09,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:09,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:09,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:09,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:09,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,102 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:10,102 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:34:10,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:10,115 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:10,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:10,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:10,116 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:10,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:10,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,149 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:10,150 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:10,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,150 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,175 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:10,175 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:34:10,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:10,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:10,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:10,318 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2022-12-06 07:34:10,319 INFO L420 AbstractCegarLoop]: === Iteration 926 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1718234335, now seen corresponding path program 1 times [2022-12-06 07:34:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191512396] [2022-12-06 07:34:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,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:10,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191512396] [2022-12-06 07:34:10,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191512396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467957017] [2022-12-06 07:34:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:10,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:10,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:10,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:10,675 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:10,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:10,686 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:10,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:10,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:10,687 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:10,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:10,716 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:10,717 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:10,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:10,717 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:10,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:10,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,742 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:10,742 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:34:10,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:10,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:10,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:10,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:10,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:34:10,887 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:10,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:10,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2022-12-06 07:34:10,888 INFO L420 AbstractCegarLoop]: === Iteration 927 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -833922626, now seen corresponding path program 1 times [2022-12-06 07:34:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:10,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098120127] [2022-12-06 07:34:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:10,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:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:10,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098120127] [2022-12-06 07:34:10,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098120127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:10,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:10,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390394863] [2022-12-06 07:34:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:10,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:10,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:10,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:10,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:10,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,239 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:11,239 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:11,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:11,254 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:11,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:11,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:11,255 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:11,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:11,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,292 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:11,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:11,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,292 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,317 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:11,317 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:11,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:11,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:11,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:11,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:34:11,470 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:11,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:11,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:11,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2022-12-06 07:34:11,470 INFO L420 AbstractCegarLoop]: === Iteration 928 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 908887709, now seen corresponding path program 1 times [2022-12-06 07:34:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:11,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049804295] [2022-12-06 07:34:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:11,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:11,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:11,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:11,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049804295] [2022-12-06 07:34:11,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049804295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:11,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:11,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070549722] [2022-12-06 07:34:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:11,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:11,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:11,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:11,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:11,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:11,803 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:11,803 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:11,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:11,815 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:11,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:11,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:11,816 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:11,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:11,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:11,869 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:11,869 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:11,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:11,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:11,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:11,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,894 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:11,894 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:34:11,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:11,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:11,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:12,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:34:12,048 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:12,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2022-12-06 07:34:12,048 INFO L420 AbstractCegarLoop]: === Iteration 929 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1643269252, now seen corresponding path program 1 times [2022-12-06 07:34:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054291061] [2022-12-06 07:34:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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:34:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054291061] [2022-12-06 07:34:12,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054291061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:12,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542284376] [2022-12-06 07:34:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:12,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:12,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,385 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:12,386 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:12,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13509 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:12,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:12,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:12,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:12,404 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:12,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:12,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,440 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:12,440 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:12,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,440 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,466 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:12,467 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:34:12,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:12,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:12,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:12,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:34:12,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:12,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:12,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:12,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2022-12-06 07:34:12,601 INFO L420 AbstractCegarLoop]: === Iteration 930 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 99541083, now seen corresponding path program 1 times [2022-12-06 07:34:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:12,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136809818] [2022-12-06 07:34:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:12,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:34:12,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:12,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136809818] [2022-12-06 07:34:12,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136809818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:12,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:12,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350849558] [2022-12-06 07:34:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:12,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:12,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:12,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:12,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:12,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:12,947 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:12,947 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:12,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:12,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:12,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:12,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:12,960 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:12,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:12,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:12,997 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:12,997 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:12,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:12,997 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,997 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:12,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:12,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:12,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,022 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:13,022 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:13,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:13,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:13,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:13,165 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:13,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,166 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2022-12-06 07:34:13,166 INFO L420 AbstractCegarLoop]: === Iteration 931 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1842351418, now seen corresponding path program 1 times [2022-12-06 07:34:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752568097] [2022-12-06 07:34:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752568097] [2022-12-06 07:34:13,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752568097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066406876] [2022-12-06 07:34:13,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:13,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:13,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:13,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:13,496 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:13,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:13,509 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:13,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:13,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:13,510 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:13,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:13,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:13,547 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:13,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:13,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:13,547 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:13,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:13,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,576 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:13,576 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:34:13,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:13,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:13,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:13,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:13,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:34:13,724 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:13,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:13,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:13,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2022-12-06 07:34:13,724 INFO L420 AbstractCegarLoop]: === Iteration 932 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash -709805543, now seen corresponding path program 1 times [2022-12-06 07:34:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:13,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621458887] [2022-12-06 07:34:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:13,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:13,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:13,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621458887] [2022-12-06 07:34:13,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621458887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:13,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:13,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482669565] [2022-12-06 07:34:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:13,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:13,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:13,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:13,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:13,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,061 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:14,061 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:14,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:14,074 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:14,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:14,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:14,075 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:14,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:14,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,109 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:14,110 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:14,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,110 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,134 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:14,135 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:34:14,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:14,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:14,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:34:14,274 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:14,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2022-12-06 07:34:14,274 INFO L420 AbstractCegarLoop]: === Iteration 933 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1033004792, now seen corresponding path program 1 times [2022-12-06 07:34:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357537753] [2022-12-06 07:34:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,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:34:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357537753] [2022-12-06 07:34:14,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357537753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968855050] [2022-12-06 07:34:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:14,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:14,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:14,614 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:14,614 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:34:14,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:14,626 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:14,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:14,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:14,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:14,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:14,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:14,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:14,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:14,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:14,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:14,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:14,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,682 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:14,683 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:34:14,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:14,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:14,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:14,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:14,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:34:14,832 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:14,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:14,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:14,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2022-12-06 07:34:14,832 INFO L420 AbstractCegarLoop]: === Iteration 934 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1519152169, now seen corresponding path program 1 times [2022-12-06 07:34:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056396626] [2022-12-06 07:34:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:14,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:34:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:14,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056396626] [2022-12-06 07:34:14,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056396626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:14,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:14,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878666841] [2022-12-06 07:34:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:14,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:14,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:14,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:14,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,152 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:15,152 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:15,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:15,165 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:15,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:15,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:15,166 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:15,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:15,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,202 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:15,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:15,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,227 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:15,228 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:15,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:15,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:15,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:34:15,381 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:15,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2022-12-06 07:34:15,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 (and 1 more)] === [2022-12-06 07:34:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash 223658166, now seen corresponding path program 1 times [2022-12-06 07:34:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379035825] [2022-12-06 07:34:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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:34:15,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379035825] [2022-12-06 07:34:15,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379035825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:15,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142852538] [2022-12-06 07:34:15,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:15,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:15,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:15,724 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:15,724 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:15,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:15,734 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:15,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:15,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:15,735 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:15,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:15,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:15,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:15,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:15,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:15,765 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:15,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:15,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,789 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:15,790 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:15,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:15,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:15,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:15,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:15,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:34:15,929 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:15,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:15,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:15,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2022-12-06 07:34:15,930 INFO L420 AbstractCegarLoop]: === Iteration 936 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1966468501, now seen corresponding path program 1 times [2022-12-06 07:34:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909293281] [2022-12-06 07:34:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:15,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:15,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:15,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909293281] [2022-12-06 07:34:15,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909293281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:15,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:15,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704526777] [2022-12-06 07:34:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:15,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:15,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:15,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:15,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:15,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:15,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,250 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:16,250 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:16,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:16,264 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:16,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:16,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:16,265 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:16,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:16,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:16,301 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:16,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,327 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:16,327 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:16,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:16,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:16,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:16,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:34:16,482 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:16,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:16,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:16,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2022-12-06 07:34:16,483 INFO L420 AbstractCegarLoop]: === Iteration 937 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:16,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash -585688460, now seen corresponding path program 1 times [2022-12-06 07:34:16,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:16,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445945229] [2022-12-06 07:34:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:16,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445945229] [2022-12-06 07:34:16,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445945229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:16,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:16,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:16,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400099132] [2022-12-06 07:34:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:16,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:16,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:16,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:16,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:16,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:16,828 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:16,828 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:16,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:16,841 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:16,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:16,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:16,842 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:16,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:16,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:16,877 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:16,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:16,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:16,877 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:16,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:16,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,901 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:16,901 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:34:16,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:16,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:16,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:17,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:34:17,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:17,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2022-12-06 07:34:17,063 INFO L420 AbstractCegarLoop]: === Iteration 938 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1157121875, now seen corresponding path program 1 times [2022-12-06 07:34:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788091843] [2022-12-06 07:34:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788091843] [2022-12-06 07:34:17,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788091843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942314959] [2022-12-06 07:34:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:17,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:17,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,393 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:17,393 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:17,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:17,407 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:17,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:17,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:17,408 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:17,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:17,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:17,442 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:17,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:17,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:17,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:17,442 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:17,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:17,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:17,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:17,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:17,467 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:17,468 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:17,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:17,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:17,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:17,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:17,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:17,605 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:17,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2022-12-06 07:34:17,605 INFO L420 AbstractCegarLoop]: === Iteration 939 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1395035086, now seen corresponding path program 1 times [2022-12-06 07:34:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110100407] [2022-12-06 07:34:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:17,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:34:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:17,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110100407] [2022-12-06 07:34:17,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110100407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:17,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:17,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894880955] [2022-12-06 07:34:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:17,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:17,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:17,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:17,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:17,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:17,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:17,957 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:17,958 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:17,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:17,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:17,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:17,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:17,972 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:17,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:18,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:18,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:18,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,035 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:18,035 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:18,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:18,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:18,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:34:18,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:18,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2022-12-06 07:34:18,190 INFO L420 AbstractCegarLoop]: === Iteration 940 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash 347775249, now seen corresponding path program 1 times [2022-12-06 07:34:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608037435] [2022-12-06 07:34:18,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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:34:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608037435] [2022-12-06 07:34:18,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608037435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186372448] [2022-12-06 07:34:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:18,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:18,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,577 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:18,577 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:18,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:18,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:18,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:18,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:18,591 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:18,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:18,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:18,627 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:18,627 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:18,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,628 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,652 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:18,653 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:18,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:18,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:18,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:18,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:18,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:18,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:18,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2022-12-06 07:34:18,797 INFO L420 AbstractCegarLoop]: === Iteration 941 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2090585584, now seen corresponding path program 1 times [2022-12-06 07:34:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981403406] [2022-12-06 07:34:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,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:34:18,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981403406] [2022-12-06 07:34:18,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981403406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:18,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:18,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970366469] [2022-12-06 07:34:18,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:18,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:18,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:18,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:18,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:18,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,130 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:19,130 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:19,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:19,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:19,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:19,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:19,143 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:19,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:19,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,176 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:19,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:19,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:19,176 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:19,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:19,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,202 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:19,202 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:34:19,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:19,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:19,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:19,339 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:19,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2022-12-06 07:34:19,339 INFO L420 AbstractCegarLoop]: === Iteration 942 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash -461571377, now seen corresponding path program 1 times [2022-12-06 07:34:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:19,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494629644] [2022-12-06 07:34:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,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:34:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494629644] [2022-12-06 07:34:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494629644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314970761] [2022-12-06 07:34:19,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:19,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:19,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:19,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:19,682 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:19,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:19,693 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:19,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:19,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:19,694 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:19,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:19,723 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:19,723 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:19,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:19,723 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:19,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:19,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,748 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:19,748 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:34:19,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:19,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:19,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:19,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:19,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:34:19,888 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:19,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:19,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:19,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2022-12-06 07:34:19,888 INFO L420 AbstractCegarLoop]: === Iteration 943 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1281238958, 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 [1835108694] [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,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,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:34:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:19,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835108694] [2022-12-06 07:34:19,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835108694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:19,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:19,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007839305] [2022-12-06 07:34:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:19,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:19,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:19,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:19,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:19,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,242 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:20,243 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:20,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:20,257 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:20,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:20,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:20,258 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:20,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:20,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:20,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:20,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:20,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,298 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,324 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:20,324 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:34:20,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:20,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:20,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:20,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:34:20,463 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:20,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:20,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:20,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2022-12-06 07:34:20,464 INFO L420 AbstractCegarLoop]: === Iteration 944 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1270918003, now seen corresponding path program 1 times [2022-12-06 07:34:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:20,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77071149] [2022-12-06 07:34:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:20,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:20,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77071149] [2022-12-06 07:34:20,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77071149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:20,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:20,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040093646] [2022-12-06 07:34:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:20,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:20,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:20,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,810 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:20,810 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:20,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:20,824 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:20,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:20,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:20,825 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:20,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:20,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:20,858 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:20,859 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:20,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,859 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,890 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:20,890 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:20,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:20,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:20,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:21,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:34:21,036 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:21,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2022-12-06 07:34:21,036 INFO L420 AbstractCegarLoop]: === Iteration 945 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 471892332, now seen corresponding path program 1 times [2022-12-06 07:34:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273068712] [2022-12-06 07:34:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,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:34:21,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273068712] [2022-12-06 07:34:21,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273068712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349148947] [2022-12-06 07:34:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:21,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:21,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:21,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:21,384 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:21,400 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:21,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:21,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:21,400 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:21,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:21,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:21,437 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:21,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:21,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:21,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:21,438 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:21,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:21,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:21,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:21,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:21,464 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:21,464 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:34:21,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:21,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:21,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:21,611 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:21,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:34:21,612 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:21,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:21,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:21,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2022-12-06 07:34:21,612 INFO L420 AbstractCegarLoop]: === Iteration 946 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:21,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2080264629, now seen corresponding path program 1 times [2022-12-06 07:34:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:21,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085341080] [2022-12-06 07:34:21,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:21,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085341080] [2022-12-06 07:34:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085341080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:21,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:21,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568085504] [2022-12-06 07:34:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:21,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:21,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:21,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:21,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:21,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:22,000 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:22,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:22,013 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:22,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:22,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:22,013 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:22,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:22,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,046 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:22,046 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:22,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,072 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:22,072 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:22,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:22,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:22,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:34:22,219 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:22,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2022-12-06 07:34:22,219 INFO L420 AbstractCegarLoop]: === Iteration 947 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:22,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,219 INFO L85 PathProgramCache]: Analyzing trace with hash -337454294, now seen corresponding path program 1 times [2022-12-06 07:34:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070108768] [2022-12-06 07:34:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,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:34:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070108768] [2022-12-06 07:34:22,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070108768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496851864] [2022-12-06 07:34:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:22,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:22,625 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:22,625 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:22,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:22,641 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:22,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:22,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:22,642 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:22,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:22,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:22,677 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:22,677 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:22,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:22,677 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:22,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:22,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,702 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:22,702 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:22,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:22,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:22,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:22,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:22,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:34:22,839 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:22,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:22,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:22,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2022-12-06 07:34:22,839 INFO L420 AbstractCegarLoop]: === Iteration 948 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1405356041, now seen corresponding path program 1 times [2022-12-06 07:34:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312479574] [2022-12-06 07:34:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:22,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:34:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:22,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312479574] [2022-12-06 07:34:22,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312479574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:22,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:22,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017891976] [2022-12-06 07:34:22,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:22,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:22,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:22,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:22,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:22,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:22,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,202 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:23,202 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:23,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:23,216 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:23,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:23,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:23,217 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:23,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:23,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,254 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,254 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:23,254 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:23,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,280 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:23,280 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:23,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:23,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:23,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:34:23,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:23,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2022-12-06 07:34:23,435 INFO L420 AbstractCegarLoop]: === Iteration 949 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1146800920, now seen corresponding path program 1 times [2022-12-06 07:34:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448871637] [2022-12-06 07:34:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:23,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:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448871637] [2022-12-06 07:34:23,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448871637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:23,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:23,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940541665] [2022-12-06 07:34:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:23,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:23,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:23,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:23,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:23,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:23,786 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:23,786 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:23,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:23,798 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:23,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:23,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:23,799 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:23,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:23,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:23,831 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:23,831 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:23,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:23,831 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:23,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:23,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,857 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:23,857 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:34:23,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:23,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:23,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:23,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:23,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:34:23,998 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:23,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:23,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2022-12-06 07:34:23,999 INFO L420 AbstractCegarLoop]: === Iteration 950 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash 596009415, now seen corresponding path program 1 times [2022-12-06 07:34:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:23,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80266534] [2022-12-06 07:34:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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:34:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80266534] [2022-12-06 07:34:24,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80266534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:24,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729621256] [2022-12-06 07:34:24,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:24,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:24,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,347 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:24,347 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:24,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13585 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:24,360 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:24,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:24,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:24,361 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:24,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:24,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,397 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,397 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:24,397 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:24,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,397 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,422 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:24,422 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:34:24,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:24,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:24,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:34:24,564 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:24,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2022-12-06 07:34:24,564 INFO L420 AbstractCegarLoop]: === Iteration 951 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1956147546, now seen corresponding path program 1 times [2022-12-06 07:34:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616963022] [2022-12-06 07:34:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:24,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:34:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:24,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616963022] [2022-12-06 07:34:24,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616963022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:24,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:24,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799883864] [2022-12-06 07:34:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:24,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:24,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:24,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:24,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:24,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:24,921 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:24,921 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:24,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:24,931 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:24,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:24,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:24,932 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:24,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:24,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:24,960 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:24,961 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:24,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:24,961 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:24,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:24,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,985 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:24,986 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:24,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:24,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:24,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:25,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:34:25,142 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:25,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2022-12-06 07:34:25,142 INFO L420 AbstractCegarLoop]: === Iteration 952 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -213337211, now seen corresponding path program 1 times [2022-12-06 07:34:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787965417] [2022-12-06 07:34:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787965417] [2022-12-06 07:34:25,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787965417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237952194] [2022-12-06 07:34:25,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:25,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:25,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:25,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:25,469 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:25,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:25,482 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:25,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:25,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:25,483 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:25,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:25,520 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:25,520 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:25,520 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:25,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:25,520 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:25,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:25,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:25,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:25,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:25,548 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:25,548 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:34:25,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:25,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:25,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:25,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:25,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:34:25,690 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:25,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:25,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:25,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2022-12-06 07:34:25,690 INFO L420 AbstractCegarLoop]: === Iteration 953 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1529473124, now seen corresponding path program 1 times [2022-12-06 07:34:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844175655] [2022-12-06 07:34:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,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:34:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844175655] [2022-12-06 07:34:25,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844175655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:25,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:25,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:25,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828414673] [2022-12-06 07:34:25,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:25,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:25,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:25,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:25,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:25,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:25,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:25,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:25,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,027 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:26,027 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:26,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13507 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:26,039 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:26,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:26,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:26,040 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:26,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:26,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:26,072 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:26,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,072 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,097 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:26,097 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 07:34:26,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:26,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:26,240 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:26,240 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:26,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2022-12-06 07:34:26,240 INFO L420 AbstractCegarLoop]: === Iteration 954 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1022683837, now seen corresponding path program 1 times [2022-12-06 07:34:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720155536] [2022-12-06 07:34:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:26,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:34:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720155536] [2022-12-06 07:34:26,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720155536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:26,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636448149] [2022-12-06 07:34:26,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:26,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:26,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:26,590 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:26,590 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:26,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:26,603 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:26,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:26,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:26,604 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:26,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:26,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:26,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:26,641 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:26,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:26,641 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:26,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:26,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,665 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:26,666 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:34:26,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:26,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:26,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:26,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:26,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:26,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:26,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:26,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:26,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2022-12-06 07:34:26,809 INFO L420 AbstractCegarLoop]: === Iteration 955 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash 720126498, now seen corresponding path program 1 times [2022-12-06 07:34:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:26,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149736523] [2022-12-06 07:34:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:26,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:34:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:26,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149736523] [2022-12-06 07:34:26,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149736523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:26,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:26,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537026906] [2022-12-06 07:34:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:26,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:26,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:26,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:26,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:26,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,163 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:27,164 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:27,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:27,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:27,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:27,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:27,178 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:27,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:27,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,213 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:27,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:27,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,237 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:27,238 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:34:27,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:27,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:27,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:27,376 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:27,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2022-12-06 07:34:27,377 INFO L420 AbstractCegarLoop]: === Iteration 956 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1832030463, now seen corresponding path program 1 times [2022-12-06 07:34:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285499291] [2022-12-06 07:34:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285499291] [2022-12-06 07:34:27,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285499291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859967358] [2022-12-06 07:34:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:27,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:27,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:27,715 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:27,715 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:27,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:27,728 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:27,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:27,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:27,729 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:27,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:27,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:27,762 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:27,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:27,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:27,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:27,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:27,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,787 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:27,787 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:27,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:27,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:27,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:27,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:34:27,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:27,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:27,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:27,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2022-12-06 07:34:27,935 INFO L420 AbstractCegarLoop]: === Iteration 957 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:27,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -89220128, now seen corresponding path program 1 times [2022-12-06 07:34:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:27,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215721334] [2022-12-06 07:34:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:27,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:27,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:34:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:27,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215721334] [2022-12-06 07:34:27,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215721334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:27,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:27,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:27,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692380376] [2022-12-06 07:34:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:27,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:27,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:27,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:27,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:27,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:28,267 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:28,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:28,280 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:28,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:28,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:28,282 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:28,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:28,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:28,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:28,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,319 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,345 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:28,345 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:34:28,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:28,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:28,495 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:28,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:34:28,496 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:28,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:28,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:28,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2022-12-06 07:34:28,496 INFO L420 AbstractCegarLoop]: === Iteration 958 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1653590207, now seen corresponding path program 1 times [2022-12-06 07:34:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:28,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448931128] [2022-12-06 07:34:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:28,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:34:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:28,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448931128] [2022-12-06 07:34:28,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448931128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:28,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:28,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444535834] [2022-12-06 07:34:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:28,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:28,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:28,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:28,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:28,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:28,859 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:28,859 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:28,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:28,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:28,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:28,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:28,872 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:28,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:28,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:28,905 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:28,905 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:28,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:28,906 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,906 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:28,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:28,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,930 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:28,931 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 07:34:28,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:28,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:28,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:29,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:34:29,081 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:29,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2022-12-06 07:34:29,081 INFO L420 AbstractCegarLoop]: === Iteration 959 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -898566754, now seen corresponding path program 1 times [2022-12-06 07:34:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032341905] [2022-12-06 07:34:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032341905] [2022-12-06 07:34:29,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032341905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873443566] [2022-12-06 07:34:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:29,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:29,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:29,431 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:29,431 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:29,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:29,445 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:29,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:29,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:29,446 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:29,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:29,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:29,485 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:29,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:29,485 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:29,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:29,485 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:29,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:29,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:29,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:29,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:29,510 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:29,511 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:34:29,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:29,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:29,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:29,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:29,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:34:29,671 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:29,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:29,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:29,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2022-12-06 07:34:29,671 INFO L420 AbstractCegarLoop]: === Iteration 960 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 844243581, now seen corresponding path program 1 times [2022-12-06 07:34:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:29,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547071874] [2022-12-06 07:34:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:29,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:34:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:29,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547071874] [2022-12-06 07:34:29,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547071874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:29,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:29,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139316999] [2022-12-06 07:34:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:29,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:29,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:29,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:29,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:29,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,026 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:30,027 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:30,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:30,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:30,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:30,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:30,041 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:30,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:30,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,076 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:30,076 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:30,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,076 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,110 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:30,110 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:34:30,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:30,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:30,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:34:30,251 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:30,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,251 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2022-12-06 07:34:30,251 INFO L420 AbstractCegarLoop]: === Iteration 961 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1707913380, now seen corresponding path program 1 times [2022-12-06 07:34:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783164441] [2022-12-06 07:34:30,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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:34:30,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783164441] [2022-12-06 07:34:30,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783164441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:30,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566709293] [2022-12-06 07:34:30,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:30,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:30,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:30,592 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:30,592 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:30,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:30,605 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:30,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:30,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:30,606 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:30,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:30,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:30,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:30,641 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:30,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:30,641 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:30,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:30,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,666 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:30,666 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:34:30,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:30,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:30,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:30,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:30,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:30,804 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:30,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:30,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:30,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2022-12-06 07:34:30,804 INFO L420 AbstractCegarLoop]: === Iteration 962 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 34896955, now seen corresponding path program 1 times [2022-12-06 07:34:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:30,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804991165] [2022-12-06 07:34:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:30,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:34:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804991165] [2022-12-06 07:34:30,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804991165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:30,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:30,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379829509] [2022-12-06 07:34:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:30,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:30,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:30,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:30,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:30,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,144 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:31,144 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:31,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:31,158 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:31,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:31,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:31,158 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:31,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:31,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,194 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:31,194 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:31,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,194 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,219 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:31,220 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 07:34:31,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3288/3497 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:31,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:31,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:34:31,365 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:31,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2022-12-06 07:34:31,365 INFO L420 AbstractCegarLoop]: === Iteration 963 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1777707290, now seen corresponding path program 1 times [2022-12-06 07:34:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618116085] [2022-12-06 07:34:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618116085] [2022-12-06 07:34:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618116085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864552206] [2022-12-06 07:34:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:31,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:31,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:31,703 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:31,704 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:31,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:31,717 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:31,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:31,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:31,718 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:31,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:31,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:31,754 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:31,754 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:31,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:31,754 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:31,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:31,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,779 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:31,779 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:31,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:31,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:31,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:31,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:31,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:34:31,918 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:31,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:31,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2022-12-06 07:34:31,919 INFO L420 AbstractCegarLoop]: === Iteration 964 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash -774449671, now seen corresponding path program 1 times [2022-12-06 07:34:31,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:31,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707998932] [2022-12-06 07:34:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:31,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:31,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:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:31,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707998932] [2022-12-06 07:34:31,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707998932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:31,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:31,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219443361] [2022-12-06 07:34:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:31,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:31,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:31,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:31,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:31,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,268 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:32,268 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:32,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:32,280 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:32,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:32,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:32,281 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:32,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:32,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:32,314 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:32,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,314 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,339 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:32,339 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:32,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:32,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:32,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:32,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:34:32,471 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:32,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:32,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:32,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2022-12-06 07:34:32,472 INFO L420 AbstractCegarLoop]: === Iteration 965 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash 968360664, now seen corresponding path program 1 times [2022-12-06 07:34:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:32,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31466056] [2022-12-06 07:34:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:32,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:32,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:32,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31466056] [2022-12-06 07:34:32,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31466056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:32,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:32,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327905318] [2022-12-06 07:34:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:32,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:32,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:32,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:32,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:32,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:32,812 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:32,813 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:32,824 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:32,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:32,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:32,824 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:32,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:32,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:32,856 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:32,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:32,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:32,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:32,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:32,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,882 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:32,882 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:34:32,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:32,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:32,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:33,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:34:33,039 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:33,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2022-12-06 07:34:33,040 INFO L420 AbstractCegarLoop]: === Iteration 966 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1583796297, now seen corresponding path program 1 times [2022-12-06 07:34:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944204253] [2022-12-06 07:34:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,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:34:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944204253] [2022-12-06 07:34:33,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944204253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919719958] [2022-12-06 07:34:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:33,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,391 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:33,392 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:33,408 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:33,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:33,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:33,409 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:33,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:33,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:33,445 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:33,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:33,446 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:33,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:33,446 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:33,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:33,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:33,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:33,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:33,472 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:33,472 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:33,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:33,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:33,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:33,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:33,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:34:33,632 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:33,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:33,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:33,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2022-12-06 07:34:33,632 INFO L420 AbstractCegarLoop]: === Iteration 967 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 159014038, now seen corresponding path program 1 times [2022-12-06 07:34:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224356243] [2022-12-06 07:34:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:33,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224356243] [2022-12-06 07:34:33,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224356243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:33,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:33,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576622462] [2022-12-06 07:34:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:33,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:33,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:33,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:33,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:33,979 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:33,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:34,012 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:34,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:34,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:34,013 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:34,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:34,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:34,042 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:34,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,042 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,067 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:34,067 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:34:34,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:34,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:34,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:34:34,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:34,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2022-12-06 07:34:34,202 INFO L420 AbstractCegarLoop]: === Iteration 968 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1901824373, now seen corresponding path program 1 times [2022-12-06 07:34:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108445677] [2022-12-06 07:34:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:34,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108445677] [2022-12-06 07:34:34,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108445677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952569069] [2022-12-06 07:34:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:34,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:34,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:34,530 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:34,530 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13510 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:34,543 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:34,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:34,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:34,543 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:34,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:34,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:34,580 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:34,580 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:34,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:34,581 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:34,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:34,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,605 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:34,605 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:34,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:34,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:34,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:34,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:34,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:34:34,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:34,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:34,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2022-12-06 07:34:34,744 INFO L420 AbstractCegarLoop]: === Iteration 969 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash -650332588, now seen corresponding path program 1 times [2022-12-06 07:34:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312446570] [2022-12-06 07:34:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:34,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:34:34,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:34,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312446570] [2022-12-06 07:34:34,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312446570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:34,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:34,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:34,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025599905] [2022-12-06 07:34:34,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:34,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:34,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:34,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:34,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,065 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:35,066 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:35,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:35,078 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:35,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:35,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:35,078 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:35,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:35,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,112 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:35,112 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:35,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,112 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,136 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:35,136 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:34:35,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:35,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:35,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:34:35,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:35,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2022-12-06 07:34:35,282 INFO L420 AbstractCegarLoop]: === Iteration 970 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1092477747, now seen corresponding path program 1 times [2022-12-06 07:34:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286638013] [2022-12-06 07:34:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:35,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286638013] [2022-12-06 07:34:35,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286638013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254672267] [2022-12-06 07:34:35,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:35,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:35,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:35,629 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:35,629 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:35,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:35,645 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:35,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:35,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:35,646 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:35,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:35,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:35,683 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:35,683 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:35,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:35,683 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:35,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:35,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,708 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:35,708 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:35,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:35,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:35,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:35,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:35,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:34:35,865 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:35,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:35,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:35,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2022-12-06 07:34:35,865 INFO L420 AbstractCegarLoop]: === Iteration 971 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1459679214, now seen corresponding path program 1 times [2022-12-06 07:34:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735126182] [2022-12-06 07:34:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:35,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:34:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:35,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735126182] [2022-12-06 07:34:35,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735126182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:35,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:35,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082837643] [2022-12-06 07:34:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:35,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:35,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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 L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:35,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:35,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,192 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:36,192 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:36,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:36,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:36,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:36,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:36,206 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:36,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:36,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:36,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:36,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,266 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:36,266 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:36,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:36,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:36,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:36,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:34:36,430 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:36,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:36,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:36,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2022-12-06 07:34:36,431 INFO L420 AbstractCegarLoop]: === Iteration 972 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash 283131121, now seen corresponding path program 1 times [2022-12-06 07:34:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:36,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537888425] [2022-12-06 07:34:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:36,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:34:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:36,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537888425] [2022-12-06 07:34:36,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537888425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:36,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:36,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913358834] [2022-12-06 07:34:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:36,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:36,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:36,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:36,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:36,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:36,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:36,791 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:36,791 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:36,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13570 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:36,803 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:36,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:36,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:36,804 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:36,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:36,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:36,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:36,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:36,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:36,839 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:36,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:36,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,864 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:36,864 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:36,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:36,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:36,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:37,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 07:34:37,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:37,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2022-12-06 07:34:37,037 INFO L420 AbstractCegarLoop]: === Iteration 973 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2025941456, now seen corresponding path program 1 times [2022-12-06 07:34:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612188975] [2022-12-06 07:34:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:37,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:37,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612188975] [2022-12-06 07:34:37,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612188975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144858654] [2022-12-06 07:34:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:37,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:37,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:37,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:37,425 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:37,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:37,438 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:37,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:37,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:37,439 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:37,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:37,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:37,472 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:37,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:37,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:37,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:37,472 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:37,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:37,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:37,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:37,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:37,497 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:37,497 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:34:37,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:37,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:37,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:37,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:37,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:34:37,653 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:37,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:37,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:37,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2022-12-06 07:34:37,653 INFO L420 AbstractCegarLoop]: === Iteration 974 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash -526215505, now seen corresponding path program 1 times [2022-12-06 07:34:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:37,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137811877] [2022-12-06 07:34:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:37,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:34:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137811877] [2022-12-06 07:34:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137811877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:37,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:37,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016639734] [2022-12-06 07:34:37,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:37,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:37,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:37,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:37,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:37,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:37,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,053 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:38,053 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:38,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:38,067 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:38,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:38,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:38,068 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:38,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:38,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,105 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:38,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:38,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,130 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:38,130 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:38,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:38,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:38,279 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:34:38,280 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:38,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2022-12-06 07:34:38,280 INFO L420 AbstractCegarLoop]: === Iteration 975 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1216594830, now seen corresponding path program 1 times [2022-12-06 07:34:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415755533] [2022-12-06 07:34:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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:34:38,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415755533] [2022-12-06 07:34:38,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415755533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818305756] [2022-12-06 07:34:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:38,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:38,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:38,644 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:38,645 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:38,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13513 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:38,658 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:38,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:38,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:38,658 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:38,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:38,695 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:38,695 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:38,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:38,695 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:38,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:38,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,720 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:38,720 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:38,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:38,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:38,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:38,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:38,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:34:38,867 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:38,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:38,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:38,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2022-12-06 07:34:38,867 INFO L420 AbstractCegarLoop]: === Iteration 976 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1335562131, now seen corresponding path program 1 times [2022-12-06 07:34:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:38,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043410300] [2022-12-06 07:34:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:38,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:34:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043410300] [2022-12-06 07:34:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043410300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:38,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:38,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548015019] [2022-12-06 07:34:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:38,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:38,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:38,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:38,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:38,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:38,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:38,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,206 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:39,206 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:39,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:39,219 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:39,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:39,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:39,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:39,220 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:39,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:39,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:39,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:39,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,283 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:39,283 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:39,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:39,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:39,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:34:39,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:39,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2022-12-06 07:34:39,434 INFO L420 AbstractCegarLoop]: === Iteration 977 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 407248204, now seen corresponding path program 1 times [2022-12-06 07:34:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873668343] [2022-12-06 07:34:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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:34:39,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:39,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873668343] [2022-12-06 07:34:39,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873668343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:39,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:39,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782829539] [2022-12-06 07:34:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:39,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:39,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:39,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:39,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:39,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:39,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:39,763 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:39,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:39,777 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:39,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:39,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:39,778 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:39,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:39,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:39,815 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:39,815 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:39,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:39,815 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:39,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:39,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,844 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:39,844 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:34:39,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:39,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:39,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:39,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:39,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:34:39,986 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:39,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:39,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:39,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2022-12-06 07:34:39,986 INFO L420 AbstractCegarLoop]: === Iteration 978 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:39,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2144908757, now seen corresponding path program 1 times [2022-12-06 07:34:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:39,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661780098] [2022-12-06 07:34:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,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:34:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661780098] [2022-12-06 07:34:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661780098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055729939] [2022-12-06 07:34:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:40,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:40,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,325 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:40,326 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:34:40,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:40,339 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:40,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:40,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:40,340 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:40,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:40,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,376 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:40,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:40,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,377 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,402 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:40,402 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:34:40,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:40,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:40,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:40,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:34:40,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:40,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:40,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:40,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2022-12-06 07:34:40,557 INFO L420 AbstractCegarLoop]: === Iteration 979 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash -402098422, now seen corresponding path program 1 times [2022-12-06 07:34:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:40,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287052294] [2022-12-06 07:34:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:40,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:34:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:40,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287052294] [2022-12-06 07:34:40,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287052294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:40,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:40,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:40,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052448894] [2022-12-06 07:34:40,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:40,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:40,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:40,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:40,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:40,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:40,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:40,932 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:40,932 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:40,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:40,946 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:40,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:40,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:40,947 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:40,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:40,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:40,984 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:40,985 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:40,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:40,985 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:40,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:40,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:40,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,010 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:41,010 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:41,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:41,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:41,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:41,153 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:41,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2022-12-06 07:34:41,153 INFO L420 AbstractCegarLoop]: === Iteration 980 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:41,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1340711913, now seen corresponding path program 1 times [2022-12-06 07:34:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640587689] [2022-12-06 07:34:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:41,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:34:41,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640587689] [2022-12-06 07:34:41,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640587689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547829418] [2022-12-06 07:34:41,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:41,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:41,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:41,484 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:41,484 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:34:41,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:41,498 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:41,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:41,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:41,499 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:41,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:41,533 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:41,533 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:41,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:41,533 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:41,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:41,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,558 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:41,558 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:34:41,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3010 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:41,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:41,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:41,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:41,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:41,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:41,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:41,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:41,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2022-12-06 07:34:41,701 INFO L420 AbstractCegarLoop]: === Iteration 981 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1211445048, now seen corresponding path program 1 times [2022-12-06 07:34:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:41,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805032770] [2022-12-06 07:34:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:41,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:34:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805032770] [2022-12-06 07:34:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805032770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:41,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:41,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896013404] [2022-12-06 07:34:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:41,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:41,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:41,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:41,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:41,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:41,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,047 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:42,047 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:42,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:42,059 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:42,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:42,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:42,060 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:42,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:42,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,088 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:42,088 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:42,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,089 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,114 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:42,114 INFO L131 PetriNetUnfolder]: For 3175/3318 co-relation queries the response was YES. [2022-12-06 07:34:42,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3175/3318 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:42,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:42,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:34:42,264 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:42,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2022-12-06 07:34:42,264 INFO L420 AbstractCegarLoop]: === Iteration 982 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 531365287, now seen corresponding path program 1 times [2022-12-06 07:34:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545291320] [2022-12-06 07:34:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,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:34:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545291320] [2022-12-06 07:34:42,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545291320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003726919] [2022-12-06 07:34:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:42,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:42,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:42,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:42,622 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:42,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:42,635 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:42,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:42,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:42,636 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:42,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:42,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:42,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:42,674 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:42,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:42,674 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:42,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:42,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,699 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:42,699 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:42,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:42,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:42,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:42,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:34:42,856 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:42,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:42,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:42,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2022-12-06 07:34:42,856 INFO L420 AbstractCegarLoop]: === Iteration 983 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2020791674, now seen corresponding path program 1 times [2022-12-06 07:34:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:42,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438253152] [2022-12-06 07:34:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:42,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:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438253152] [2022-12-06 07:34:42,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438253152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:42,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:42,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:42,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415352682] [2022-12-06 07:34:42,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:42,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:42,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:42,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:42,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:42,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,180 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:43,180 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:43,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:43,193 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:43,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:43,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:43,193 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:43,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:43,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,227 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:43,227 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:43,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,228 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,260 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:43,260 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:43,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:43,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:43,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:34:43,404 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:43,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2022-12-06 07:34:43,404 INFO L420 AbstractCegarLoop]: === Iteration 984 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash -277981339, now seen corresponding path program 1 times [2022-12-06 07:34:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926580116] [2022-12-06 07:34:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:43,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:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:43,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926580116] [2022-12-06 07:34:43,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926580116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:43,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:43,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265222352] [2022-12-06 07:34:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:43,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:43,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:43,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:43,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:43,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:43,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:43,778 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:43,779 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:43,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13507 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:43,795 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:43,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:43,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:43,796 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:43,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:43,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:43,832 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:43,832 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:43,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:43,833 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:43,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:43,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,858 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:43,858 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:34:43,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:43,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:43,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:43,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:43,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:34:43,992 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:43,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:43,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:43,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2022-12-06 07:34:43,992 INFO L420 AbstractCegarLoop]: === Iteration 985 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:43,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1464828996, now seen corresponding path program 1 times [2022-12-06 07:34:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:43,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652270457] [2022-12-06 07:34:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652270457] [2022-12-06 07:34:44,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652270457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522847549] [2022-12-06 07:34:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:44,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:44,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:44,328 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:44,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:44,341 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:44,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:44,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:44,341 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:44,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:44,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:44,374 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:44,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,374 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,399 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:44,399 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 07:34:44,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3174/3317 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3010 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:44,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:44,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:44,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:34:44,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:44,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:44,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:44,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2022-12-06 07:34:44,532 INFO L420 AbstractCegarLoop]: === Iteration 986 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1087327965, now seen corresponding path program 1 times [2022-12-06 07:34:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:44,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388542790] [2022-12-06 07:34:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:44,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:34:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:44,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388542790] [2022-12-06 07:34:44,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388542790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:44,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:44,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399716847] [2022-12-06 07:34:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:44,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:44,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:44,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:44,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:44,868 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:44,868 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:44,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:44,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:44,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:44,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:44,881 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:44,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:44,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:44,913 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:44,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:44,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:44,914 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:44,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:44,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,938 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:44,938 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:44,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:44,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:44,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:45,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:34:45,098 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:45,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2022-12-06 07:34:45,098 INFO L420 AbstractCegarLoop]: === Iteration 987 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash 655482370, now seen corresponding path program 1 times [2022-12-06 07:34:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467671449] [2022-12-06 07:34:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:45,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:34:45,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467671449] [2022-12-06 07:34:45,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467671449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:45,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912290238] [2022-12-06 07:34:45,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:45,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:45,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,441 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:45,441 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:45,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:45,454 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:45,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:45,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:45,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:45,455 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:45,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:45,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:45,490 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:45,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:45,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:45,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:45,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:45,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:45,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:45,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:45,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:45,515 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:45,515 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:34:45,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:45,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:45,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:45,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:45,658 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:34:45,658 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:45,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,658 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:45,658 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:45,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2022-12-06 07:34:45,658 INFO L420 AbstractCegarLoop]: === Iteration 988 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1896674591, now seen corresponding path program 1 times [2022-12-06 07:34:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:45,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662595954] [2022-12-06 07:34:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34: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:34:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:45,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662595954] [2022-12-06 07:34:45,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662595954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:45,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:45,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:45,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947861315] [2022-12-06 07:34:45,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:45,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:45,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:45,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:45,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:45,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:45,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:45,993 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:45,993 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:45,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:46,005 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:46,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:46,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:46,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:46,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:46,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,038 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:46,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:46,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,063 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:46,063 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:46,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:46,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:46,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:34:46,200 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:46,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2022-12-06 07:34:46,200 INFO L420 AbstractCegarLoop]: === Iteration 989 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash -153864256, now seen corresponding path program 1 times [2022-12-06 07:34:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959738128] [2022-12-06 07:34:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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:34:46,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959738128] [2022-12-06 07:34:46,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959738128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855953353] [2022-12-06 07:34:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:46,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:46,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:46,541 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:46,542 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:46,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:46,554 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:46,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:46,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:46,555 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:46,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:46,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:46,587 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:46,588 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:46,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:46,588 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:46,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:46,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,612 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:46,612 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:34:46,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:46,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:46,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:46,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:46,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:34:46,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:46,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:46,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:46,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2022-12-06 07:34:46,754 INFO L420 AbstractCegarLoop]: === Iteration 990 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1588946079, now seen corresponding path program 1 times [2022-12-06 07:34:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:46,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263560659] [2022-12-06 07:34:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:46,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:34:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:46,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263560659] [2022-12-06 07:34:46,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263560659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:46,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:46,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36950769] [2022-12-06 07:34:46,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:46,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:46,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:46,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:46,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:46,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:47,090 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:47,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:47,104 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:47,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:47,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:47,105 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:47,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:47,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,165 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:47,165 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:47,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,165 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,192 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:47,193 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:47,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:47,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:47,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:34:47,354 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:47,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2022-12-06 07:34:47,354 INFO L420 AbstractCegarLoop]: === Iteration 991 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -963210882, now seen corresponding path program 1 times [2022-12-06 07:34:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164149854] [2022-12-06 07:34:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164149854] [2022-12-06 07:34:47,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164149854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280467711] [2022-12-06 07:34:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:47,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:47,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:47,692 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:47,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:47,704 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:47,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:47,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:47,705 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:47,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:47,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:47,740 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:47,740 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:47,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:47,740 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:47,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:47,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,764 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:47,765 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:34:47,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:47,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:47,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:47,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:47,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:34:47,921 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:47,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:47,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:47,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2022-12-06 07:34:47,922 INFO L420 AbstractCegarLoop]: === Iteration 992 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 779599453, now seen corresponding path program 1 times [2022-12-06 07:34:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:47,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702555354] [2022-12-06 07:34:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:47,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:34:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:47,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702555354] [2022-12-06 07:34:47,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702555354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:47,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:47,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:47,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444426078] [2022-12-06 07:34:47,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:47,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:47,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:47,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:47,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:47,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:47,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,251 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:48,251 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:48,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:48,264 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:48,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:48,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:48,265 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:48,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:48,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,302 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:48,302 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:48,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,327 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:48,327 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:48,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:48,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:48,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:48,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:34:48,471 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:48,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:48,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:48,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2022-12-06 07:34:48,472 INFO L420 AbstractCegarLoop]: === Iteration 993 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1772557508, now seen corresponding path program 1 times [2022-12-06 07:34:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318475365] [2022-12-06 07:34:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:48,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:48,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:48,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318475365] [2022-12-06 07:34:48,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318475365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:48,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:48,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030684078] [2022-12-06 07:34:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:48,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:48,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:48,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:48,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:48,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:48,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:48,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:48,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:48,826 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:34:48,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:48,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:48,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:48,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:48,839 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:48,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:48,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:48,875 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:48,876 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:48,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:48,876 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:48,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:48,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,900 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:48,901 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:34:48,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:48,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:48,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:49,049 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:34:49,050 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:49,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2022-12-06 07:34:49,050 INFO L420 AbstractCegarLoop]: === Iteration 994 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash -29747173, now seen corresponding path program 1 times [2022-12-06 07:34:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949955927] [2022-12-06 07:34:49,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:49,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:34:49,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949955927] [2022-12-06 07:34:49,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949955927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36037212] [2022-12-06 07:34:49,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:49,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:49,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:49,384 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:34:49,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:49,397 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:49,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:49,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:49,398 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:49,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:49,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,432 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,457 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:49,457 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:34:49,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:49,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:49,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:49,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:34:49,602 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:49,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:49,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:49,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2022-12-06 07:34:49,602 INFO L420 AbstractCegarLoop]: === Iteration 995 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1713063162, now seen corresponding path program 1 times [2022-12-06 07:34:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:49,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21142494] [2022-12-06 07:34:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:49,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21142494] [2022-12-06 07:34:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21142494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260924189] [2022-12-06 07:34:49,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:49,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:49,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:49,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:49,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:49,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:49,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:49,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:49,926 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:49,926 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:49,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:49,938 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:49,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:49,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:49,939 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:49,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:49,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:49,970 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:49,970 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:49,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:49,970 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:49,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:49,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,995 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:49,995 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:49,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:49,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:49,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:50,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:34:50,151 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:50,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2022-12-06 07:34:50,151 INFO L420 AbstractCegarLoop]: === Iteration 996 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash -839093799, now seen corresponding path program 1 times [2022-12-06 07:34:50,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579843548] [2022-12-06 07:34:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579843548] [2022-12-06 07:34:50,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579843548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009825909] [2022-12-06 07:34:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:50,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:50,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:50,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:50,493 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:50,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13584 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:50,506 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:50,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:50,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:50,507 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:50,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:50,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:50,542 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:50,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:50,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:50,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:50,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:50,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:50,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:50,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:50,567 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:50,567 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:34:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:50,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:50,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:50,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:50,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:34:50,716 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:50,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:50,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:50,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2022-12-06 07:34:50,716 INFO L420 AbstractCegarLoop]: === Iteration 997 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 903716536, now seen corresponding path program 1 times [2022-12-06 07:34:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:50,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763766973] [2022-12-06 07:34:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:50,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:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:50,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763766973] [2022-12-06 07:34:50,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763766973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:50,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:50,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458296542] [2022-12-06 07:34:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:50,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:50,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:50,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:50,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:50,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:50,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:50,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,084 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:51,084 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:51,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:51,095 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:51,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:51,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:51,096 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:51,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:51,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,125 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:51,126 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:51,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,126 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,151 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:51,151 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 07:34:51,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:51,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:51,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:34:51,286 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:51,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2022-12-06 07:34:51,286 INFO L420 AbstractCegarLoop]: === Iteration 998 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1648440425, now seen corresponding path program 1 times [2022-12-06 07:34:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755757013] [2022-12-06 07:34:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:51,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:34:51,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755757013] [2022-12-06 07:34:51,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755757013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25958596] [2022-12-06 07:34:51,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:51,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:51,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:51,632 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:34:51,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:51,648 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:51,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:51,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:51,649 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:51,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:51,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:51,690 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:51,690 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:51,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:51,690 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:51,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:51,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,719 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:51,719 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:34:51,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:51,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:51,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:51,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:51,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:34:51,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:51,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:51,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:51,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2022-12-06 07:34:51,882 INFO L420 AbstractCegarLoop]: === Iteration 999 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash 94369910, now seen corresponding path program 1 times [2022-12-06 07:34:51,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:51,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353927705] [2022-12-06 07:34:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:51,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:34:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:51,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353927705] [2022-12-06 07:34:51,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353927705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:51,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:51,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787433463] [2022-12-06 07:34:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:51,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:51,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:51,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:51,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:52,219 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:34:52,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:52,232 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:52,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:52,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:52,233 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:52,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:52,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,268 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:52,269 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:52,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,269 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,301 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:52,302 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:52,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:52,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:52,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:52,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:34:52,448 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:52,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:52,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:52,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2022-12-06 07:34:52,448 INFO L420 AbstractCegarLoop]: === Iteration 1000 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1837180245, now seen corresponding path program 1 times [2022-12-06 07:34:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:52,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189203240] [2022-12-06 07:34:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189203240] [2022-12-06 07:34:52,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189203240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:52,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:52,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235458442] [2022-12-06 07:34:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:52,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:52,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:52,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:52,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:52,802 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:52,802 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:34:52,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:52,817 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:52,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:52,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:52,818 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:52,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:52,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:52,855 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:52,855 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:52,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:52,855 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:52,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:52,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,881 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:52,881 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:34:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:52,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:52,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:53,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:34:53,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:53,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2022-12-06 07:34:53,024 INFO L420 AbstractCegarLoop]: === Iteration 1001 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash -714976716, now seen corresponding path program 1 times [2022-12-06 07:34:53,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389112670] [2022-12-06 07:34:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389112670] [2022-12-06 07:34:53,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389112670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103328334] [2022-12-06 07:34:53,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:53,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:53,368 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:53,368 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:53,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:53,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:53,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:53,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:53,387 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:53,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:53,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:53,435 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:53,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:53,435 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:53,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:53,435 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:53,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:53,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:53,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:53,462 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:53,462 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:34:53,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:53,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:53,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:53,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:53,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:34:53,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:53,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:53,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:53,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2022-12-06 07:34:53,614 INFO L420 AbstractCegarLoop]: === Iteration 1002 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1027833619, now seen corresponding path program 1 times [2022-12-06 07:34:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:53,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116524457] [2022-12-06 07:34:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:53,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:53,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:53,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116524457] [2022-12-06 07:34:53,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116524457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:53,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:53,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300994733] [2022-12-06 07:34:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:53,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:53,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:53,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:53,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:53,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,036 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:54,037 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:34:54,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:54,050 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:54,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:54,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:54,050 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:54,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:54,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,085 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:54,085 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:54,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,085 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,110 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:34:54,110 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:34:54,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:34:54,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:54,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:34:54,266 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:54,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2022-12-06 07:34:54,266 INFO L420 AbstractCegarLoop]: === Iteration 1003 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1524323342, now seen corresponding path program 1 times [2022-12-06 07:34:54,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763967128] [2022-12-06 07:34:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,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:34:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763967128] [2022-12-06 07:34:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763967128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:54,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637719226] [2022-12-06 07:34:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:54,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:54,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:54,641 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:54,642 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:34:54,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:54,655 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:54,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:54,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:54,656 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:54,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:54,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:54,689 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:54,689 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:54,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:54,689 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:54,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:54,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,714 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:54,714 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:34:54,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:54,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:54,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:54,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:54,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:34:54,850 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:54,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:54,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:54,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2022-12-06 07:34:54,850 INFO L420 AbstractCegarLoop]: === Iteration 1004 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 218486993, now seen corresponding path program 1 times [2022-12-06 07:34:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:54,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082413973] [2022-12-06 07:34:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:54,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:34:54,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:54,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082413973] [2022-12-06 07:34:54,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082413973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:54,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:54,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89127735] [2022-12-06 07:34:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:54,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:54,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:54,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:54,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:54,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,190 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:55,191 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:55,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:55,202 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:55,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:55,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:55,203 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:55,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:55,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:55,234 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:55,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:55,234 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,259 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:55,259 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:55,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:55,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:55,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:34:55,403 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:55,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2022-12-06 07:34:55,403 INFO L420 AbstractCegarLoop]: === Iteration 1005 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1961297328, now seen corresponding path program 1 times [2022-12-06 07:34:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189989810] [2022-12-06 07:34:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:55,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:34:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:55,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189989810] [2022-12-06 07:34:55,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189989810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:55,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:55,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097718574] [2022-12-06 07:34:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:55,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:55,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:55,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:55,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:55,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:55,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:55,742 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:55,743 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:55,756 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:55,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:55,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:55,757 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:55,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:55,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:55,794 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:55,794 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:55,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:55,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,819 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:55,819 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:34:55,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:55,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:55,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:55,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:55,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:55,957 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:55,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:55,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:55,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2022-12-06 07:34:55,957 INFO L420 AbstractCegarLoop]: === Iteration 1006 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -590859633, now seen corresponding path program 1 times [2022-12-06 07:34:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:55,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984044694] [2022-12-06 07:34:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:56,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:34:56,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984044694] [2022-12-06 07:34:56,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984044694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707019827] [2022-12-06 07:34:56,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:56,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:56,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:56,285 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:56,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:56,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:56,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:56,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:56,299 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:56,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:56,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,334 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:56,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:56,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,334 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,367 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:56,367 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:34:56,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:56,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:56,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:56,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 07:34:56,528 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:56,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:56,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:56,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2022-12-06 07:34:56,528 INFO L420 AbstractCegarLoop]: === Iteration 1007 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1151950702, now seen corresponding path program 1 times [2022-12-06 07:34:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:56,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105410927] [2022-12-06 07:34:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:56,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:34:56,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:56,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105410927] [2022-12-06 07:34:56,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105410927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:56,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:56,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407552515] [2022-12-06 07:34:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:56,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:56,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:56,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:56,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:56,861 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:56,862 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:56,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13592 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:56,875 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:56,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:56,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:56,876 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:56,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:56,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:56,911 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:56,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:56,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:56,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:56,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:56,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,936 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:56,936 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:34:56,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:56,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:56,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:57,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:34:57,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:57,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2022-12-06 07:34:57,074 INFO L420 AbstractCegarLoop]: === Iteration 1008 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1400206259, now seen corresponding path program 1 times [2022-12-06 07:34:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205923566] [2022-12-06 07:34:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,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:34:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205923566] [2022-12-06 07:34:57,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205923566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827533745] [2022-12-06 07:34:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:57,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:57,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,401 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:57,401 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:57,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:57,416 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:57,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:57,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:57,417 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:57,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:57,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:57,461 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:57,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:57,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:57,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:57,462 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:57,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:57,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:57,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:57,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:57,489 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:57,490 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:57,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:57,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:57,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:57,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:57,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:34:57,645 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:57,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:57,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:57,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2022-12-06 07:34:57,645 INFO L420 AbstractCegarLoop]: === Iteration 1009 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:57,645 INFO L85 PathProgramCache]: Analyzing trace with hash 342604076, now seen corresponding path program 1 times [2022-12-06 07:34:57,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:57,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617862166] [2022-12-06 07:34:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:57,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:34:57,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:57,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617862166] [2022-12-06 07:34:57,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617862166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:57,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:57,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66541308] [2022-12-06 07:34:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:57,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:57,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:57,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:57,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:57,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:57,975 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:57,975 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:57,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13587 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:57,988 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:57,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:57,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:57,989 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:58,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,025 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:58,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:58,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,050 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:58,051 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:34:58,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:58,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:58,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:34:58,205 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:58,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2022-12-06 07:34:58,205 INFO L420 AbstractCegarLoop]: === Iteration 1010 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2085414411, now seen corresponding path program 1 times [2022-12-06 07:34:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260811027] [2022-12-06 07:34:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,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:34:58,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260811027] [2022-12-06 07:34:58,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260811027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938313317] [2022-12-06 07:34:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:58,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:58,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:58,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:58,525 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:34:58,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13525 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:58,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:58,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:58,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:58,541 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:58,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:58,576 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:58,576 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:58,576 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:58,576 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:58,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:58,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,601 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:58,602 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:34:58,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:58,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:58,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:58,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:58,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:34:58,748 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:58,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:58,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:58,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2022-12-06 07:34:58,749 INFO L420 AbstractCegarLoop]: === Iteration 1011 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash -466742550, now seen corresponding path program 1 times [2022-12-06 07:34:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:58,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454844889] [2022-12-06 07:34:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:58,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:34:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:58,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454844889] [2022-12-06 07:34:58,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454844889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:58,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:58,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:58,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774539186] [2022-12-06 07:34:58,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:58,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:58,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:58,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:58,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:58,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,105 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:59,106 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:34:59,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:59,117 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:59,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:59,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:59,118 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:59,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:59,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,150 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:59,150 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:59,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,150 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,175 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:59,175 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:34:59,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:59,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:59,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:34:59,310 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:59,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,310 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2022-12-06 07:34:59,311 INFO L420 AbstractCegarLoop]: === Iteration 1012 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1276067785, now seen corresponding path program 1 times [2022-12-06 07:34:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616631362] [2022-12-06 07:34:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616631362] [2022-12-06 07:34:59,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616631362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919004323] [2022-12-06 07:34:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:59,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:59,636 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:34:59,636 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:34:59,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:34:59,649 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:34:59,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:34:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:34:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:34:59,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:34:59,649 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:34:59,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:34:59,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:59,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:34:59,687 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:34:59,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:59,687 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:59,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:59,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,711 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:34:59,711 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:34:59,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:34:59,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:34:59,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:34:59,859 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:59,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:34:59,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:34:59,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:59,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:59,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2022-12-06 07:34:59,860 INFO L420 AbstractCegarLoop]: === Iteration 1013 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1276089176, now seen corresponding path program 1 times [2022-12-06 07:34:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:59,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590113227] [2022-12-06 07:34:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:59,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:34:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:59,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590113227] [2022-12-06 07:34:59,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590113227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:59,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:34:59,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:34:59,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248655321] [2022-12-06 07:34:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:59,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:34:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:34:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:34:59,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:34:59,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:59,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:34:59,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,180 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:00,180 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:00,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:00,193 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:00,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:00,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:00,193 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:00,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:00,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,228 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:00,228 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:00,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,228 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,261 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:00,261 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:35:00,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:00,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:00,394 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:35:00,394 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:00,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2022-12-06 07:35:00,394 INFO L420 AbstractCegarLoop]: === Iteration 1014 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash 466721159, now seen corresponding path program 1 times [2022-12-06 07:35:00,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195310408] [2022-12-06 07:35:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:00,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:35:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:00,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195310408] [2022-12-06 07:35:00,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195310408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:00,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:00,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724521982] [2022-12-06 07:35:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:00,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:00,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:00,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:00,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:00,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:00,737 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:00,737 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:00,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:00,750 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:00,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:00,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:00,751 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:00,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:00,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:00,787 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:00,788 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:00,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:00,788 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:00,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:00,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,813 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:00,813 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:35:00,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:00,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:00,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:00,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:00,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:35:00,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:00,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:00,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:00,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2022-12-06 07:35:00,956 INFO L420 AbstractCegarLoop]: === Iteration 1015 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2085435802, now seen corresponding path program 1 times [2022-12-06 07:35:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661219688] [2022-12-06 07:35:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661219688] [2022-12-06 07:35:01,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661219688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603878363] [2022-12-06 07:35:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:01,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:01,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,280 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:01,280 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:35:01,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13527 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:01,293 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:01,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:01,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:01,294 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:01,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:01,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,330 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:01,330 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:01,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,330 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,355 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:01,355 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:01,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:01,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:01,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:01,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:35:01,492 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:01,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:01,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:01,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2022-12-06 07:35:01,493 INFO L420 AbstractCegarLoop]: === Iteration 1016 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -342625467, now seen corresponding path program 1 times [2022-12-06 07:35:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:01,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125236218] [2022-12-06 07:35:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:01,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:35:01,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:01,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125236218] [2022-12-06 07:35:01,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125236218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:01,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:01,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703850016] [2022-12-06 07:35:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:01,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:01,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:01,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:01,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:01,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:01,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:01,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:01,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:01,826 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:35:01,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:01,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:01,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:01,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:01,840 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:01,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:01,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:01,874 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:01,875 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:01,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:01,875 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:01,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:01,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,899 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:01,899 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:35:01,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:01,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:01,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:02,066 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:35:02,066 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:02,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2022-12-06 07:35:02,067 INFO L420 AbstractCegarLoop]: === Iteration 1017 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:02,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1400184868, now seen corresponding path program 1 times [2022-12-06 07:35:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502286329] [2022-12-06 07:35:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:02,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:35:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502286329] [2022-12-06 07:35:02,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502286329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760875076] [2022-12-06 07:35:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:02,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:02,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:02,435 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:02,436 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:35:02,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:02,449 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:02,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:02,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:02,450 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:02,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:02,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:02,489 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:02,489 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:02,489 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:02,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:02,489 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:02,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:02,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:02,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:02,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:02,519 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:02,520 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:35:02,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:02,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:02,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:02,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:02,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:02,657 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:02,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:02,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:02,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2022-12-06 07:35:02,657 INFO L420 AbstractCegarLoop]: === Iteration 1018 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1151972093, now seen corresponding path program 1 times [2022-12-06 07:35:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:02,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118093959] [2022-12-06 07:35:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:02,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118093959] [2022-12-06 07:35:02,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118093959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:02,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:02,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352099991] [2022-12-06 07:35:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:02,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:02,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:02,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:02,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:02,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,012 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:03,012 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:03,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:03,024 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:03,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:03,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:03,025 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:03,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:03,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,060 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:03,060 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:03,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,060 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,085 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:03,085 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:03,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:03,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:03,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:35:03,234 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:03,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2022-12-06 07:35:03,234 INFO L420 AbstractCegarLoop]: === Iteration 1019 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,234 INFO L85 PathProgramCache]: Analyzing trace with hash 590838242, now seen corresponding path program 1 times [2022-12-06 07:35:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899131895] [2022-12-06 07:35:03,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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:35:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899131895] [2022-12-06 07:35:03,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899131895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:03,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90121297] [2022-12-06 07:35:03,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:03,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:03,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:03,578 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:03,578 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:03,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:03,592 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:03,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:03,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:03,593 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:03,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:03,632 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:03,632 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:03,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:03,632 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:03,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:03,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,658 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:03,658 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:03,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:03,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:03,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:03,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:03,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 07:35:03,832 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:03,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:03,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:03,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2022-12-06 07:35:03,832 INFO L420 AbstractCegarLoop]: === Iteration 1020 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1961318719, now seen corresponding path program 1 times [2022-12-06 07:35:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:03,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058601451] [2022-12-06 07:35:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:03,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:35:03,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:03,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058601451] [2022-12-06 07:35:03,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058601451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:03,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:03,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834587607] [2022-12-06 07:35:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:03,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:03,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:03,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:03,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:03,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,172 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:04,172 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:04,188 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:04,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:04,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:04,189 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:04,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:04,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,227 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:04,227 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:04,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,227 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,259 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:04,259 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:04,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:04,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:04,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:35:04,398 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:04,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2022-12-06 07:35:04,398 INFO L420 AbstractCegarLoop]: === Iteration 1021 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash -218508384, now seen corresponding path program 1 times [2022-12-06 07:35:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739384374] [2022-12-06 07:35:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:04,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:35:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:04,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739384374] [2022-12-06 07:35:04,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739384374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:04,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:04,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603571781] [2022-12-06 07:35:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:04,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:04,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:04,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:04,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:04,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:04,737 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:04,737 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:04,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:04,751 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:04,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:04,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:04,752 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:04,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:04,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:04,787 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:04,787 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:04,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:04,787 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:04,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:04,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,812 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:04,812 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:35:04,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:04,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:04,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:04,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:04,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:04,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:04,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2022-12-06 07:35:04,956 INFO L420 AbstractCegarLoop]: === Iteration 1022 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1524301951, now seen corresponding path program 1 times [2022-12-06 07:35:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313048612] [2022-12-06 07:35:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313048612] [2022-12-06 07:35:05,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313048612] 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 [4] imperfect sequences [] total 4 [2022-12-06 07:35:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288291985] [2022-12-06 07:35:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:05,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,281 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:05,281 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:35:05,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:05,294 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:05,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:05,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:05,295 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:05,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:05,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,330 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:05,330 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:05,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,330 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,355 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:05,355 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:35:05,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:05,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:05,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:05,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:05,498 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:05,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:05,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:05,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2022-12-06 07:35:05,498 INFO L420 AbstractCegarLoop]: === Iteration 1023 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1027855010, now seen corresponding path program 1 times [2022-12-06 07:35:05,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:05,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83691713] [2022-12-06 07:35:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:05,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:05,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83691713] [2022-12-06 07:35:05,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83691713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:05,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:05,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:05,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886685050] [2022-12-06 07:35:05,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:05,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:05,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:05,556 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:05,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:05,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:05,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:05,843 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:05,843 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:35:05,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:05,856 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:05,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:05,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:05,856 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:05,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:05,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:05,891 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:05,892 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:05,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:05,892 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:05,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:05,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,916 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:05,916 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:35:05,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:05,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:05,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:06,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:35:06,055 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:06,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2022-12-06 07:35:06,067 INFO L420 AbstractCegarLoop]: === Iteration 1024 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash 714955325, now seen corresponding path program 1 times [2022-12-06 07:35:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861983485] [2022-12-06 07:35:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:06,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:35:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861983485] [2022-12-06 07:35:06,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861983485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588835202] [2022-12-06 07:35:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:06,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:06,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:06,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:06,417 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:06,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:06,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:06,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:06,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:06,431 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:06,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:06,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:06,466 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:06,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:06,466 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:06,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:06,466 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:06,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:06,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:06,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:06,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:06,491 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:06,491 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:06,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:06,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:06,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:06,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:06,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:35:06,652 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:06,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:06,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:06,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2022-12-06 07:35:06,653 INFO L420 AbstractCegarLoop]: === Iteration 1025 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1837201636, now seen corresponding path program 1 times [2022-12-06 07:35:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:06,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035985019] [2022-12-06 07:35:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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:35:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:06,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035985019] [2022-12-06 07:35:06,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035985019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:06,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:06,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030750533] [2022-12-06 07:35:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:06,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:06,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:06,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:06,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:06,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,058 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:07,058 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:07,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:07,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:07,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:07,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:07,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:07,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:07,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,103 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:07,103 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:07,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,103 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,128 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:07,128 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:07,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:07,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:07,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:35:07,281 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:07,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2022-12-06 07:35:07,281 INFO L420 AbstractCegarLoop]: === Iteration 1026 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -94391301, now seen corresponding path program 1 times [2022-12-06 07:35:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288481726] [2022-12-06 07:35:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,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:35:07,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288481726] [2022-12-06 07:35:07,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288481726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:07,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719311936] [2022-12-06 07:35:07,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:07,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:07,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:07,649 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:07,649 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:07,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:07,662 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:07,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:07,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:07,663 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:07,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:07,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:07,696 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:07,696 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:07,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:07,696 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:07,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:07,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,722 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:07,722 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:07,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:07,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:07,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:07,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:07,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:07,873 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:07,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:07,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:07,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2022-12-06 07:35:07,874 INFO L420 AbstractCegarLoop]: === Iteration 1027 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1648419034, now seen corresponding path program 1 times [2022-12-06 07:35:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:07,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811612759] [2022-12-06 07:35:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811612759] [2022-12-06 07:35:07,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811612759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:07,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:07,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188902553] [2022-12-06 07:35:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:07,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:07,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:07,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:07,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,197 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:08,197 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:35:08,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:08,210 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:08,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:08,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:08,210 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:08,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:08,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,263 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:08,263 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:08,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,288 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:08,288 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:35:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3009 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:08,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:08,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:35:08,426 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:08,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2022-12-06 07:35:08,427 INFO L420 AbstractCegarLoop]: === Iteration 1028 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash -903737927, now seen corresponding path program 1 times [2022-12-06 07:35:08,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598278183] [2022-12-06 07:35:08,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598278183] [2022-12-06 07:35:08,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598278183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:08,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:08,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366961207] [2022-12-06 07:35:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:08,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:08,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:08,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:08,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:08,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:08,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:08,744 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:08,745 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:08,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:08,758 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:08,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:08,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:08,759 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:08,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:08,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:08,794 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:08,794 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:08,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,794 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,818 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:08,819 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:08,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:08,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:08,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:08,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:35:08,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:08,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:08,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:08,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2022-12-06 07:35:08,967 INFO L420 AbstractCegarLoop]: === Iteration 1029 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:08,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash 839072408, now seen corresponding path program 1 times [2022-12-06 07:35:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:08,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50409361] [2022-12-06 07:35:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,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:35:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50409361] [2022-12-06 07:35:09,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50409361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326861655] [2022-12-06 07:35:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:09,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:09,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,341 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:09,341 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:09,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:09,354 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:09,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:09,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:09,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:09,355 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:09,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:09,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,390 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:09,390 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:09,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,390 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,391 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,415 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:09,415 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:35:09,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:09,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:09,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:09,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:35:09,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:09,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:09,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:09,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2022-12-06 07:35:09,557 INFO L420 AbstractCegarLoop]: === Iteration 1030 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:09,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:09,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1713084553, now seen corresponding path program 1 times [2022-12-06 07:35:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:09,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245357870] [2022-12-06 07:35:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:09,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:35:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:09,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245357870] [2022-12-06 07:35:09,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245357870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:09,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:09,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437535702] [2022-12-06 07:35:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:09,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:09,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:09,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:09,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:09,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:09,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:09,893 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:09,894 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:35:09,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:09,908 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:09,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:09,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:09,908 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:09,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:09,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:09,949 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:09,949 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:09,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:09,949 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:09,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:09,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,974 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:09,975 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:09,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:09,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:09,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:10,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:35:10,111 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:10,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2022-12-06 07:35:10,111 INFO L420 AbstractCegarLoop]: === Iteration 1031 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:10,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 29725782, now seen corresponding path program 1 times [2022-12-06 07:35:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775018741] [2022-12-06 07:35:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:10,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:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775018741] [2022-12-06 07:35:10,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775018741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575463579] [2022-12-06 07:35:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:10,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:10,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:10,453 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:10,453 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:10,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:10,465 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:10,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:10,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:10,466 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:10,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:10,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:10,501 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:10,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:10,501 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:10,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:10,501 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:10,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:10,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:10,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:10,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:10,528 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:10,528 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:35:10,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:10,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:10,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:10,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:10,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:35:10,686 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:10,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:10,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:10,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2022-12-06 07:35:10,686 INFO L420 AbstractCegarLoop]: === Iteration 1032 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1772536117, now seen corresponding path program 1 times [2022-12-06 07:35:10,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:10,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012950332] [2022-12-06 07:35:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:10,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:35:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:10,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012950332] [2022-12-06 07:35:10,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012950332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:10,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:10,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848733255] [2022-12-06 07:35:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:10,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:10,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:10,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:10,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:10,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,033 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:11,033 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:11,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:11,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:11,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:11,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:11,045 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:11,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:11,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,077 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:11,077 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:11,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,077 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,101 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:11,102 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:35:11,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:11,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:11,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:35:11,244 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:11,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2022-12-06 07:35:11,244 INFO L420 AbstractCegarLoop]: === Iteration 1033 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash -779620844, now seen corresponding path program 1 times [2022-12-06 07:35:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658646003] [2022-12-06 07:35:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,244 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,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:35:11,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658646003] [2022-12-06 07:35:11,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658646003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937337678] [2022-12-06 07:35:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:11,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:11,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:11,589 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:11,589 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:11,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:11,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:11,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:11,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:11,602 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:11,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:11,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:11,636 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:11,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:11,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:11,636 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:11,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:11,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,661 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:11,661 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:35:11,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:11,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:11,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:11,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:11,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:11,804 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:11,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:11,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:11,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2022-12-06 07:35:11,804 INFO L420 AbstractCegarLoop]: === Iteration 1034 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash 963189491, now seen corresponding path program 1 times [2022-12-06 07:35:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:11,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735897756] [2022-12-06 07:35:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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:35:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:11,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735897756] [2022-12-06 07:35:11,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735897756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:11,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:11,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73479286] [2022-12-06 07:35:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:11,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:11,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:11,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:11,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:11,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:11,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:11,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,162 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:12,162 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:12,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:12,172 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:12,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:12,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:12,172 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:12,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:12,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,201 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:12,201 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:12,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,201 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,226 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:12,226 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:12,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:12,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:12,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 07:35:12,393 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:12,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2022-12-06 07:35:12,393 INFO L420 AbstractCegarLoop]: === Iteration 1035 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1588967470, now seen corresponding path program 1 times [2022-12-06 07:35:12,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89551016] [2022-12-06 07:35:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:12,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:35:12,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:12,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89551016] [2022-12-06 07:35:12,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89551016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:12,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:12,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902423007] [2022-12-06 07:35:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:12,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:12,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:12,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:12,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:12,743 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:12,743 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:12,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:12,756 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:12,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:12,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:12,757 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:12,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:12,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:12,791 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:12,791 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:12,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:12,791 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:12,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:12,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:12,817 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:35:12,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2962 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:12,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:12,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:12,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:12,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:35:12,970 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:12,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:12,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2022-12-06 07:35:12,970 INFO L420 AbstractCegarLoop]: === Iteration 1036 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 153842865, now seen corresponding path program 1 times [2022-12-06 07:35:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14487639] [2022-12-06 07:35:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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:35:13,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14487639] [2022-12-06 07:35:13,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14487639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994397516] [2022-12-06 07:35:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:13,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:13,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,287 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:13,287 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:13,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:13,299 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:13,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:13,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:13,300 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:13,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:13,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,332 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,332 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:13,332 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:13,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,332 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,366 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:13,366 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:35:13,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:13,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:13,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:13,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:35:13,504 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:13,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:13,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:13,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2022-12-06 07:35:13,505 INFO L420 AbstractCegarLoop]: === Iteration 1037 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1896653200, now seen corresponding path program 1 times [2022-12-06 07:35:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:13,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984312875] [2022-12-06 07:35:13,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:13,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:35:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:13,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984312875] [2022-12-06 07:35:13,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984312875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:13,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929420249] [2022-12-06 07:35:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:13,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:13,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:13,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:13,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:13,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:13,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:13,868 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:13,868 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:13,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:13,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:13,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:13,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:13,881 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:13,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:13,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:13,917 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:13,917 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:13,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:13,917 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:13,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:13,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,941 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:13,942 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:35:13,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:13,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:13,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:14,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:35:14,075 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:14,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2022-12-06 07:35:14,075 INFO L420 AbstractCegarLoop]: === Iteration 1038 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -655503761, now seen corresponding path program 1 times [2022-12-06 07:35:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3275086] [2022-12-06 07:35:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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:35:14,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3275086] [2022-12-06 07:35:14,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3275086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916108547] [2022-12-06 07:35:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:14,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:14,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,411 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:14,411 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:14,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:14,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:14,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:14,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:14,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:14,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:14,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:14,458 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:14,458 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:14,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:14,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:14,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:14,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:14,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:14,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:14,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:14,483 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:14,483 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:14,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:14,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:14,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:14,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:14,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:14,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:14,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2022-12-06 07:35:14,627 INFO L420 AbstractCegarLoop]: === Iteration 1039 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1087306574, now seen corresponding path program 1 times [2022-12-06 07:35:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:14,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472707428] [2022-12-06 07:35:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:14,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:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:14,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472707428] [2022-12-06 07:35:14,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472707428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:14,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:14,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041259811] [2022-12-06 07:35:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:14,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:14,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:14,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:14,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:14,967 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:14,967 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:14,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:14,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:14,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 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 69 transitions. [2022-12-06 07:35:14,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:14,979 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:14,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:15,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:15,014 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:15,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,014 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,039 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:15,039 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:35:15,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:15,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:15,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:35:15,177 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:15,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2022-12-06 07:35:15,177 INFO L420 AbstractCegarLoop]: === Iteration 1040 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1464850387, now seen corresponding path program 1 times [2022-12-06 07:35:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099691417] [2022-12-06 07:35:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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:35:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099691417] [2022-12-06 07:35:15,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099691417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771728283] [2022-12-06 07:35:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:15,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:15,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:15,517 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:15,517 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:15,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:15,531 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:15,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:15,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:15,532 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:15,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:15,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:15,568 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:15,569 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:15,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:15,569 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:15,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:15,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,594 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:15,594 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:15,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:15,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:15,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:15,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:15,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:35:15,738 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:15,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:15,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:15,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2022-12-06 07:35:15,738 INFO L420 AbstractCegarLoop]: === Iteration 1041 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 277959948, now seen corresponding path program 1 times [2022-12-06 07:35:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:15,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953460089] [2022-12-06 07:35:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:15,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:35:15,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:15,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953460089] [2022-12-06 07:35:15,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953460089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:15,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:15,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546154445] [2022-12-06 07:35:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:15,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:15,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:15,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:15,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:15,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:15,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:16,091 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:16,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:16,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:16,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:16,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:16,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:16,103 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:16,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:16,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,132 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:16,132 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:16,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,132 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,157 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:16,157 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:16,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2958 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:16,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:16,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:35:16,290 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:16,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2022-12-06 07:35:16,290 INFO L420 AbstractCegarLoop]: === Iteration 1042 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2020770283, now seen corresponding path program 1 times [2022-12-06 07:35:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366255562] [2022-12-06 07:35:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366255562] [2022-12-06 07:35:16,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366255562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223453899] [2022-12-06 07:35:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:16,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:16,634 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:16,635 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:16,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:16,647 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:16,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:16,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:16,648 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:16,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:16,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:16,684 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:16,684 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:16,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:16,684 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:16,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:16,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,710 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:16,710 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:16,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:16,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:16,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:16,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:16,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:16,861 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:16,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:16,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:16,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2022-12-06 07:35:16,861 INFO L420 AbstractCegarLoop]: === Iteration 1043 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash -531386678, now seen corresponding path program 1 times [2022-12-06 07:35:16,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:16,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273120247] [2022-12-06 07:35:16,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:16,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:16,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:35:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:16,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273120247] [2022-12-06 07:35:16,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273120247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:16,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:16,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029139764] [2022-12-06 07:35:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:16,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:16,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:16,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:16,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,221 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:17,221 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:17,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:17,235 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:17,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:17,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:17,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:17,236 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:17,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,290 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:17,290 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:17,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,290 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,316 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:17,316 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:17,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:17,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:17,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:17,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:17,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:17,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:17,467 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2022-12-06 07:35:17,468 INFO L420 AbstractCegarLoop]: === Iteration 1044 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1211423657, now seen corresponding path program 1 times [2022-12-06 07:35:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284124314] [2022-12-06 07:35:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:17,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:35:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:17,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284124314] [2022-12-06 07:35:17,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284124314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:17,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:17,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140674788] [2022-12-06 07:35:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:17,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:17,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:17,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:17,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:17,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:17,788 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:17,789 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:35:17,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:17,803 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:17,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:17,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:17,803 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:17,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:17,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:17,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:17,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:17,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:17,838 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:17,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:17,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,864 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:17,864 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:35:17,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:17,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:17,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:18,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:18,015 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:18,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2022-12-06 07:35:18,015 INFO L420 AbstractCegarLoop]: === Iteration 1045 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1340733304, now seen corresponding path program 1 times [2022-12-06 07:35:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372413613] [2022-12-06 07:35:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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:35:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372413613] [2022-12-06 07:35:18,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372413613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343341743] [2022-12-06 07:35:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:18,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:18,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,357 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:18,357 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:18,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:18,371 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:18,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:18,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:18,372 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:18,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,409 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:18,409 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:18,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,409 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,436 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:18,436 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:18,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:18,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:18,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:18,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:35:18,585 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:18,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:18,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:18,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2022-12-06 07:35:18,585 INFO L420 AbstractCegarLoop]: === Iteration 1046 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash 402077031, now seen corresponding path program 1 times [2022-12-06 07:35:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:18,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849539050] [2022-12-06 07:35:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:18,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:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849539050] [2022-12-06 07:35:18,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849539050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:18,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:18,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44412546] [2022-12-06 07:35:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:18,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:18,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:18,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:18,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:18,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:18,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:18,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:18,940 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:18,940 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:18,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:18,953 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:18,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:18,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:18,953 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:18,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:18,988 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:18,989 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:18,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:18,989 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:18,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:18,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:18,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,014 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:19,014 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:19,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:19,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:19,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:35:19,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:19,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2022-12-06 07:35:19,162 INFO L420 AbstractCegarLoop]: === Iteration 1047 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2144887366, now seen corresponding path program 1 times [2022-12-06 07:35:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143384108] [2022-12-06 07:35:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,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:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143384108] [2022-12-06 07:35:19,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143384108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669577028] [2022-12-06 07:35:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:19,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:19,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:19,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:19,516 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:35:19,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:19,531 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:19,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:19,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:19,532 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:19,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:19,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:19,568 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:19,568 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:19,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:19,568 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:19,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:19,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,593 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:19,594 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:19,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:19,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:19,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:19,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:19,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:35:19,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:19,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:19,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:19,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2022-12-06 07:35:19,735 INFO L420 AbstractCegarLoop]: === Iteration 1048 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -407269595, now seen corresponding path program 1 times [2022-12-06 07:35:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:19,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080854093] [2022-12-06 07:35:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:19,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:35:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:19,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080854093] [2022-12-06 07:35:19,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080854093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:19,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:19,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642608423] [2022-12-06 07:35:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:19,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:19,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:19,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:19,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:19,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,082 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:20,082 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:20,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:20,095 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:20,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:20,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:20,095 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:20,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,128 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:20,128 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:20,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,128 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,152 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:20,153 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:35:20,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:20,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:20,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:35:20,299 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:20,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2022-12-06 07:35:20,299 INFO L420 AbstractCegarLoop]: === Iteration 1049 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1335540740, now seen corresponding path program 1 times [2022-12-06 07:35:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670222873] [2022-12-06 07:35:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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:35:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670222873] [2022-12-06 07:35:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670222873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:20,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093688077] [2022-12-06 07:35:20,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:20,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:20,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:20,630 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:20,630 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:35:20,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:20,643 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:20,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:20,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:20,644 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:20,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:20,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:20,680 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:20,680 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:20,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:20,680 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:20,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:20,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,704 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:20,704 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:35:20,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:20,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:20,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:20,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:20,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:35:20,854 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:20,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:20,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:20,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2022-12-06 07:35:20,854 INFO L420 AbstractCegarLoop]: === Iteration 1050 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1216616221, now seen corresponding path program 1 times [2022-12-06 07:35:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:20,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818924243] [2022-12-06 07:35:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:20,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:35:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:20,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818924243] [2022-12-06 07:35:20,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818924243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:20,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:20,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987486849] [2022-12-06 07:35:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:20,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:20,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:20,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:20,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:20,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:20,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:20,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,217 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:21,218 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:21,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:21,229 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:21,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:21,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:21,230 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:21,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,261 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:21,261 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:21,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,261 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,286 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:21,286 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:35:21,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:21,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:21,422 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:21,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:35:21,423 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:21,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:21,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:21,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2022-12-06 07:35:21,423 INFO L420 AbstractCegarLoop]: === Iteration 1051 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 526194114, now seen corresponding path program 1 times [2022-12-06 07:35:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:21,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459274381] [2022-12-06 07:35:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:21,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:35:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:21,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459274381] [2022-12-06 07:35:21,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459274381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:21,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:21,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764706354] [2022-12-06 07:35:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:21,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:21,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:21,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:21,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:21,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:21,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:21,773 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:21,773 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:21,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:21,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:21,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:21,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:21,787 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:21,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:21,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:21,824 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:21,824 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:21,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:21,824 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:21,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:21,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,849 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:21,849 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:21,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2956 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:21,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:21,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:22,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:35:22,017 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:22,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2022-12-06 07:35:22,017 INFO L420 AbstractCegarLoop]: === Iteration 1052 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2025962847, now seen corresponding path program 1 times [2022-12-06 07:35:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720690931] [2022-12-06 07:35:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:22,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:35:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720690931] [2022-12-06 07:35:22,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720690931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:22,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768563641] [2022-12-06 07:35:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:22,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:22,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,361 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:22,362 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:22,376 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:22,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:22,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:22,377 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:22,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:22,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,413 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:22,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:22,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,414 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,460 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:22,460 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:35:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:22,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:22,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:22,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:35:22,604 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:22,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:22,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:22,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2022-12-06 07:35:22,604 INFO L420 AbstractCegarLoop]: === Iteration 1053 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -283152512, now seen corresponding path program 1 times [2022-12-06 07:35:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320887147] [2022-12-06 07:35:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:22,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:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:22,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320887147] [2022-12-06 07:35:22,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320887147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:22,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:22,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408988800] [2022-12-06 07:35:22,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:22,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:22,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:22,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:22,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:22,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:22,940 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:22,940 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:22,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:22,954 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:22,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:22,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:22,954 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:22,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:22,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:22,987 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:22,988 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:22,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:22,988 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:22,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:22,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:22,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,012 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:23,012 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:35:23,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:23,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:23,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:23,156 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:23,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,156 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2022-12-06 07:35:23,156 INFO L420 AbstractCegarLoop]: === Iteration 1054 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1459657823, now seen corresponding path program 1 times [2022-12-06 07:35:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672037028] [2022-12-06 07:35:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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:35:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672037028] [2022-12-06 07:35:23,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672037028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970048370] [2022-12-06 07:35:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:23,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:23,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:23,488 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:23,488 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:35:23,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13549 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:23,501 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:23,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:23,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:23,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:23,501 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:23,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:23,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:23,538 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:23,538 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:23,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:23,538 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:23,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:23,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,563 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:23,563 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:23,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:23,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:23,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:23,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:23,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:35:23,710 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:23,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:23,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:23,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2022-12-06 07:35:23,710 INFO L420 AbstractCegarLoop]: === Iteration 1055 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1092499138, now seen corresponding path program 1 times [2022-12-06 07:35:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:23,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173403928] [2022-12-06 07:35:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:23,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:35:23,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:23,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173403928] [2022-12-06 07:35:23,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173403928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:23,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:23,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835005664] [2022-12-06 07:35:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:23,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:23,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:23,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:23,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:23,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:23,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:24,045 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:24,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:24,057 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:24,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:24,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:24,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:24,058 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:24,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:24,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,092 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:24,093 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:24,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,093 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,117 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:24,117 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:24,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:24,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:24,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:35:24,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:24,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2022-12-06 07:35:24,265 INFO L420 AbstractCegarLoop]: === Iteration 1056 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash 650311197, now seen corresponding path program 1 times [2022-12-06 07:35:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350002438] [2022-12-06 07:35:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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:24,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350002438] [2022-12-06 07:35:24,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350002438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136455908] [2022-12-06 07:35:24,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:24,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:24,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:24,619 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:24,619 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:24,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:24,633 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:24,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:24,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:24,634 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:24,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:24,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:24,672 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:24,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:24,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:24,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:24,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:24,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,698 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:24,698 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:24,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:24,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:24,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:24,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:24,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:35:24,842 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:24,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:24,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:24,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2022-12-06 07:35:24,842 INFO L420 AbstractCegarLoop]: === Iteration 1057 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1901845764, now seen corresponding path program 1 times [2022-12-06 07:35:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:24,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835115807] [2022-12-06 07:35:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:24,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:35:24,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:24,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835115807] [2022-12-06 07:35:24,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835115807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:24,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:24,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146391129] [2022-12-06 07:35:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:24,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:24,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:24,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:24,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:24,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,177 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:25,178 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:25,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:25,189 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:25,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:25,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:25,190 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:25,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,220 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:25,220 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 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,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,245 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:25,245 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:25,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:25,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:25,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:35:25,402 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:25,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2022-12-06 07:35:25,402 INFO L420 AbstractCegarLoop]: === Iteration 1058 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash -159035429, now seen corresponding path program 1 times [2022-12-06 07:35:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983050600] [2022-12-06 07:35:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:25,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:35:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:25,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983050600] [2022-12-06 07:35:25,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983050600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:25,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:25,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245848687] [2022-12-06 07:35:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:25,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:25,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:25,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:25,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:25,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:25,752 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:25,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:25,764 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:25,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:25,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:25,765 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:25,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:25,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:25,800 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:25,800 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:25,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:25,801 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:25,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:25,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,825 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:25,825 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:35:25,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:25,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:25,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:25,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:25,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:35:25,970 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:25,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:25,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:25,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2022-12-06 07:35:25,970 INFO L420 AbstractCegarLoop]: === Iteration 1059 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1583774906, now seen corresponding path program 1 times [2022-12-06 07:35:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:25,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487814631] [2022-12-06 07:35:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487814631] [2022-12-06 07:35:26,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487814631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718919792] [2022-12-06 07:35:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:26,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:26,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,289 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:26,289 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:35:26,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:26,302 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:26,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:26,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:26,303 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:26,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:26,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:26,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:26,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,369 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:26,369 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:26,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:26,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:26,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:26,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:35:26,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:26,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:26,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:26,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2022-12-06 07:35:26,510 INFO L420 AbstractCegarLoop]: === Iteration 1060 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -968382055, now seen corresponding path program 1 times [2022-12-06 07:35:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:26,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982434742] [2022-12-06 07:35:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:26,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:35:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:26,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982434742] [2022-12-06 07:35:26,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982434742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:26,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:26,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809345556] [2022-12-06 07:35:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:26,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:26,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:26,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:26,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:26,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:26,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:26,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:26,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:26,844 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:35:26,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:26,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:26,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:26,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:26,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:26,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:26,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:26,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:26,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:26,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:26,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:26,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:26,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,918 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:26,918 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:26,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:26,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:26,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:27,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:35:27,069 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:27,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2022-12-06 07:35:27,070 INFO L420 AbstractCegarLoop]: === Iteration 1061 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 774428280, now seen corresponding path program 1 times [2022-12-06 07:35:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705387117] [2022-12-06 07:35:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,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:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705387117] [2022-12-06 07:35:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705387117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084727976] [2022-12-06 07:35:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:27,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:27,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,404 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:27,404 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:27,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:27,417 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:27,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:27,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:27,418 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:27,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:27,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:27,451 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:27,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:27,452 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:27,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:27,452 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:27,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:27,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:27,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:27,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:27,476 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:27,477 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:35:27,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:27,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:27,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:27,642 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:27,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:35:27,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:27,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:27,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:27,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2022-12-06 07:35:27,643 INFO L420 AbstractCegarLoop]: === Iteration 1062 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:27,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1777728681, now seen corresponding path program 1 times [2022-12-06 07:35:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:27,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339301101] [2022-12-06 07:35:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:27,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:35:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:27,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339301101] [2022-12-06 07:35:27,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339301101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:27,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:27,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088922127] [2022-12-06 07:35:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:27,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:27,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:27,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:27,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:27,985 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:27,986 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:27,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:27,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:27,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:28,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:28,000 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:28,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:28,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,034 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:28,035 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:28,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,035 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,060 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:28,060 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:35:28,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:28,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:28,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:35:28,204 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:28,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2022-12-06 07:35:28,205 INFO L420 AbstractCegarLoop]: === Iteration 1063 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -34918346, now seen corresponding path program 1 times [2022-12-06 07:35:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011665024] [2022-12-06 07:35:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011665024] [2022-12-06 07:35:28,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011665024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916655010] [2022-12-06 07:35:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:28,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:28,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:28,522 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:28,522 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:28,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:28,536 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:28,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:28,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:28,536 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:28,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:28,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:28,570 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:28,570 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:28,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:28,570 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:28,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:28,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,595 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:28,595 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:28,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:28,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:28,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:28,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:28,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:28,747 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:28,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:28,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:28,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2022-12-06 07:35:28,748 INFO L420 AbstractCegarLoop]: === Iteration 1064 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1707891989, now seen corresponding path program 1 times [2022-12-06 07:35:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:28,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170203378] [2022-12-06 07:35:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:28,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:35:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:28,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170203378] [2022-12-06 07:35:28,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170203378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:28,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:28,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:28,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561464134] [2022-12-06 07:35:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:28,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:28,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:28,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:28,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:28,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,087 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:29,087 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:29,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:29,098 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:29,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:29,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:29,099 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:29,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:29,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:29,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:29,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,129 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,154 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:29,154 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:35:29,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:29,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:29,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:29,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:35:29,306 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:29,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:29,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2022-12-06 07:35:29,306 INFO L420 AbstractCegarLoop]: === Iteration 1065 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash -844264972, now seen corresponding path program 1 times [2022-12-06 07:35:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:29,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780510324] [2022-12-06 07:35:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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:35:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780510324] [2022-12-06 07:35:29,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780510324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51573872] [2022-12-06 07:35:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:29,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:29,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:29,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:29,621 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:29,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:29,633 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:29,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:29,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:29,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:29,634 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:29,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:29,666 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:29,666 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:29,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:29,666 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:29,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:29,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:29,690 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:35:29,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:29,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:29,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:29,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:29,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:35:29,842 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:29,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:29,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:29,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2022-12-06 07:35:29,842 INFO L420 AbstractCegarLoop]: === Iteration 1066 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 898545363, now seen corresponding path program 1 times [2022-12-06 07:35:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:29,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556419679] [2022-12-06 07:35:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:29,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:35:29,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:29,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556419679] [2022-12-06 07:35:29,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556419679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:29,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:29,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134128216] [2022-12-06 07:35:29,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:29,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:29,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:29,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:29,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:29,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,175 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:30,175 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:30,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:30,188 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:30,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:30,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:30,189 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:30,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:30,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,239 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:30,239 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:30,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,240 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,264 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:30,264 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:30,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:30,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:30,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:30,407 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:30,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2022-12-06 07:35:30,408 INFO L420 AbstractCegarLoop]: === Iteration 1067 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1653611598, now seen corresponding path program 1 times [2022-12-06 07:35:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609229327] [2022-12-06 07:35:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:30,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:35:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609229327] [2022-12-06 07:35:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609229327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:30,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:30,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776511090] [2022-12-06 07:35:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:30,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:30,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:30,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:30,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:30,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:30,737 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:30,737 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:30,749 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:30,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:30,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:30,750 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:30,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:30,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:30,785 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:30,786 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:30,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:30,786 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:30,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:30,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,810 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:30,810 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:30,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:30,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:30,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:30,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:30,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:35:30,968 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:30,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2022-12-06 07:35:30,968 INFO L420 AbstractCegarLoop]: === Iteration 1068 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 89198737, now seen corresponding path program 1 times [2022-12-06 07:35:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508176447] [2022-12-06 07:35:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508176447] [2022-12-06 07:35:31,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508176447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575345816] [2022-12-06 07:35:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:31,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,289 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:31,289 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:35:31,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:31,302 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:31,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:31,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:31,303 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:31,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:31,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,339 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:31,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:31,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,339 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,364 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:31,364 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:31,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:31,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:31,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:31,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:35:31,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:31,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:31,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:31,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2022-12-06 07:35:31,524 INFO L420 AbstractCegarLoop]: === Iteration 1069 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1832009072, now seen corresponding path program 1 times [2022-12-06 07:35:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:31,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438146590] [2022-12-06 07:35:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,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:35:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438146590] [2022-12-06 07:35:31,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438146590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:31,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:31,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177304934] [2022-12-06 07:35:31,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:31,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:31,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:31,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:31,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:31,900 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:31,900 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:31,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:31,914 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:31,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:31,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:31,915 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:31,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:31,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:31,951 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:31,952 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:31,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:31,952 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:31,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:31,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,977 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:31,977 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:31,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:31,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:31,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:32,125 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:35:32,126 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:32,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2022-12-06 07:35:32,126 INFO L420 AbstractCegarLoop]: === Iteration 1070 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash -720147889, now seen corresponding path program 1 times [2022-12-06 07:35:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169494558] [2022-12-06 07:35:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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:35:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169494558] [2022-12-06 07:35:32,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169494558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652312363] [2022-12-06 07:35:32,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:32,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:32,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,443 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:32,443 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:32,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:32,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:32,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:32,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:32,456 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:32,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:32,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:32,493 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:32,493 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:32,493 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:32,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,493 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:32,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:32,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:32,525 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:32,525 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:35:32,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:32,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:32,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:32,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:32,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:35:32,671 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:32,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2022-12-06 07:35:32,672 INFO L420 AbstractCegarLoop]: === Iteration 1071 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1022662446, now seen corresponding path program 1 times [2022-12-06 07:35:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679846784] [2022-12-06 07:35:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:32,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:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:32,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679846784] [2022-12-06 07:35:32,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679846784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:32,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:32,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063929244] [2022-12-06 07:35:32,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:32,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:32,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:32,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:32,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:32,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,005 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:33,005 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:33,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:33,018 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:33,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:33,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:33,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:33,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:33,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,053 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:33,053 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:33,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,053 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,077 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:33,078 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:33,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:33,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:33,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:33,221 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:33,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2022-12-06 07:35:33,221 INFO L420 AbstractCegarLoop]: === Iteration 1072 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1529494515, now seen corresponding path program 1 times [2022-12-06 07:35:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731793281] [2022-12-06 07:35:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:33,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:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731793281] [2022-12-06 07:35:33,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731793281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669301904] [2022-12-06 07:35:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:33,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:33,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:33,569 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:33,569 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:33,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:33,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:33,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:33,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:33,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:33,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:33,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:33,619 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,619 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:33,619 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:33,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:33,619 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:33,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:33,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,646 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:33,646 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:35:33,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:33,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:33,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:33,787 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:33,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:35:33,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:33,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:33,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:33,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2022-12-06 07:35:33,788 INFO L420 AbstractCegarLoop]: === Iteration 1073 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash 213315820, now seen corresponding path program 1 times [2022-12-06 07:35:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082056548] [2022-12-06 07:35:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:33,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:35:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082056548] [2022-12-06 07:35:33,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082056548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:33,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:33,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098771299] [2022-12-06 07:35:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:33,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:33,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:33,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:33,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:33,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:33,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:33,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:34,128 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:34,138 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:34,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:34,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:34,139 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:34,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:34,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,167 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:34,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:34,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,192 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:34,192 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 07:35:34,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:34,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:34,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:35:34,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:34,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2022-12-06 07:35:34,345 INFO L420 AbstractCegarLoop]: === Iteration 1074 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1956126155, now seen corresponding path program 1 times [2022-12-06 07:35:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512933676] [2022-12-06 07:35:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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:34,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512933676] [2022-12-06 07:35:34,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512933676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078205237] [2022-12-06 07:35:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:34,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:34,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:34,661 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:34,661 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:34,674 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:34,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:34,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:34,674 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:34,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:34,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:34,713 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:34,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:34,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:34,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:34,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:34,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,741 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:34,741 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:34,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:34,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:34,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:34,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:34,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:35:34,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:34,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:34,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:34,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2022-12-06 07:35:34,895 INFO L420 AbstractCegarLoop]: === Iteration 1075 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -596030806, now seen corresponding path program 1 times [2022-12-06 07:35:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:34,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286599153] [2022-12-06 07:35:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,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:35:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286599153] [2022-12-06 07:35:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286599153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:34,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:34,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862659718] [2022-12-06 07:35:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:34,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:34,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:34,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:34,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:34,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:35,219 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:35,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:35,231 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:35,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:35,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:35,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:35,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:35,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,265 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:35,265 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:35,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,266 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,290 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:35,290 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:35,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:35,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:35,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:35,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 07:35:35,460 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:35,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:35,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:35,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2022-12-06 07:35:35,460 INFO L420 AbstractCegarLoop]: === Iteration 1076 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:35,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1146779529, now seen corresponding path program 1 times [2022-12-06 07:35:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:35,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784565132] [2022-12-06 07:35:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:35,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:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:35,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784565132] [2022-12-06 07:35:35,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784565132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:35,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:35,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672616480] [2022-12-06 07:35:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:35,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:35,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:35,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:35,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:35,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:35,800 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:35,800 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:35,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:35,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:35,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:35,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:35,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:35,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:35,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:35,847 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:35,848 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:35,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:35,848 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:35,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:35,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,872 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:35,872 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:35,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:35,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:35,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:36,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:35:36,014 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:36,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2022-12-06 07:35:36,014 INFO L420 AbstractCegarLoop]: === Iteration 1077 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1405377432, now seen corresponding path program 1 times [2022-12-06 07:35:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156427283] [2022-12-06 07:35:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,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:35:36,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156427283] [2022-12-06 07:35:36,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156427283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:36,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396665998] [2022-12-06 07:35:36,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:36,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:36,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,347 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:36,348 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:36,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:36,365 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:36,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:36,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:36,366 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:36,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:36,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:36,407 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:36,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:36,407 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:36,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:36,407 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:36,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:36,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:36,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:36,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:36,433 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:36,433 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:35:36,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:36,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:36,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:36,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:36,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:35:36,577 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:36,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:36,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:36,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2022-12-06 07:35:36,577 INFO L420 AbstractCegarLoop]: === Iteration 1078 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash 337432903, now seen corresponding path program 1 times [2022-12-06 07:35:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:36,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370421613] [2022-12-06 07:35:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:36,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:35:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370421613] [2022-12-06 07:35:36,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370421613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:36,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:36,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163173567] [2022-12-06 07:35:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:36,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:36,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:36,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:36,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:36,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:36,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:36,964 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:36,964 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:36,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:36,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:36,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:36,980 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:36,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:37,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:37,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:37,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,030 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,060 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:37,060 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:35:37,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:37,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:37,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:35:37,212 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:37,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2022-12-06 07:35:37,213 INFO L420 AbstractCegarLoop]: === Iteration 1079 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2080243238, now seen corresponding path program 1 times [2022-12-06 07:35:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756201034] [2022-12-06 07:35:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:37,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:35:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756201034] [2022-12-06 07:35:37,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756201034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408036185] [2022-12-06 07:35:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:37,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:37,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:37,574 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:37,574 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:37,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:37,587 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:37,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:37,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:37,588 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:37,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:37,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:37,624 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:37,625 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:37,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:37,625 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:37,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:37,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,649 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:37,650 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:37,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:37,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:37,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:37,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:37,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:37,793 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:37,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:37,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:37,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2022-12-06 07:35:37,794 INFO L420 AbstractCegarLoop]: === Iteration 1080 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:37,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -471913723, now seen corresponding path program 1 times [2022-12-06 07:35:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:37,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532051240] [2022-12-06 07:35:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:37,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:35:37,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:37,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532051240] [2022-12-06 07:35:37,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532051240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:37,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:37,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743773031] [2022-12-06 07:35:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:37,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:37,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:37,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:37,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,154 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:38,155 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:38,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:38,165 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:38,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:38,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:38,166 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:38,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:38,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,198 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:38,199 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:38,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,199 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,224 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:38,224 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:38,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:38,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:38,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:35:38,369 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:38,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2022-12-06 07:35:38,369 INFO L420 AbstractCegarLoop]: === Iteration 1081 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1270896612, now seen corresponding path program 1 times [2022-12-06 07:35:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796768301] [2022-12-06 07:35:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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:35:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796768301] [2022-12-06 07:35:38,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796768301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024897929] [2022-12-06 07:35:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:38,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:38,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:38,700 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:38,700 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:38,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:38,712 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:38,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:38,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:38,713 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:38,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:38,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:38,745 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:38,745 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:38,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:38,746 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:38,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:38,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,770 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:38,770 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:35:38,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:38,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:38,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:38,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:38,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:35:38,924 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:38,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:38,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:38,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2022-12-06 07:35:38,924 INFO L420 AbstractCegarLoop]: === Iteration 1082 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1281260349, now seen corresponding path program 1 times [2022-12-06 07:35:38,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:38,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280242391] [2022-12-06 07:35:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:38,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:38,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:35:38,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:38,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280242391] [2022-12-06 07:35:38,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280242391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:38,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:38,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194783778] [2022-12-06 07:35:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:38,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:38,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:38,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:38,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:38,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:39,318 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:39,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:39,358 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:39,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:39,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:39,359 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:39,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:39,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,390 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,390 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:39,390 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:39,390 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,390 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,390 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 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,415 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:39,415 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:35:39,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:39,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:39,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:39,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 07:35:39,576 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:39,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:39,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:39,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2022-12-06 07:35:39,577 INFO L420 AbstractCegarLoop]: === Iteration 1083 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 461549986, now seen corresponding path program 1 times [2022-12-06 07:35:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:39,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451467459] [2022-12-06 07:35:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:39,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:35:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:39,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451467459] [2022-12-06 07:35:39,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451467459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:39,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:39,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843838342] [2022-12-06 07:35:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:39,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:39,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:39,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:39,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:39,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:39,919 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:39,919 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:39,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:39,932 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:39,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:39,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:39,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:39,933 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:39,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:39,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:39,968 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:39,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:39,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:39,968 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:39,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:39,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,993 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:39,994 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:35:39,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:39,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:39,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:40,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:35:40,143 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2022-12-06 07:35:40,143 INFO L420 AbstractCegarLoop]: === Iteration 1084 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:40,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2090606975, now seen corresponding path program 1 times [2022-12-06 07:35:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807516068] [2022-12-06 07:35:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,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:35:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807516068] [2022-12-06 07:35:40,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807516068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165588502] [2022-12-06 07:35:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:40,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:40,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:40,477 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:40,477 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:40,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:40,490 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:40,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:40,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:40,491 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:40,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:40,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:40,525 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:40,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:40,525 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:40,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:40,525 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:40,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:40,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:40,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:40,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:40,549 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:40,550 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:35:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:40,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:40,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:40,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:40,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:35:40,712 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:40,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:40,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:40,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2022-12-06 07:35:40,712 INFO L420 AbstractCegarLoop]: === Iteration 1085 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash -347796640, now seen corresponding path program 1 times [2022-12-06 07:35:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:40,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139042215] [2022-12-06 07:35:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:40,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:40,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139042215] [2022-12-06 07:35:40,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139042215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:40,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:40,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063326371] [2022-12-06 07:35:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:40,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:40,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:40,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,058 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:41,058 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:41,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:41,071 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:41,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:41,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:41,072 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:41,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:41,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:41,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:41,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,129 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:41,129 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:35:41,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:41,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:41,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:35:41,278 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:41,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2022-12-06 07:35:41,278 INFO L420 AbstractCegarLoop]: === Iteration 1086 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1395013695, now seen corresponding path program 1 times [2022-12-06 07:35:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908606627] [2022-12-06 07:35:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,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:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908606627] [2022-12-06 07:35:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908606627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202901185] [2022-12-06 07:35:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:41,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:41,596 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:41,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:41,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:41,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:41,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:41,609 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:41,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:41,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:41,643 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:41,643 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:41,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,643 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,668 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:41,668 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:35:41,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:41,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:41,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:41,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:41,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:35:41,803 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:41,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2022-12-06 07:35:41,804 INFO L420 AbstractCegarLoop]: === Iteration 1087 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1157143266, now seen corresponding path program 1 times [2022-12-06 07:35:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481748485] [2022-12-06 07:35:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:41,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481748485] [2022-12-06 07:35:41,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481748485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:41,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:41,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767419083] [2022-12-06 07:35:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:41,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:41,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:41,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:41,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:41,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,158 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:42,158 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:42,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:42,170 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:42,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:42,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:42,171 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:42,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,205 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:42,205 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:42,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,205 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,230 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:42,230 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:42,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:42,368 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:35:42,368 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:42,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2022-12-06 07:35:42,369 INFO L420 AbstractCegarLoop]: === Iteration 1088 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 585667069, now seen corresponding path program 1 times [2022-12-06 07:35:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159530340] [2022-12-06 07:35:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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:35:42,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159530340] [2022-12-06 07:35:42,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159530340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:42,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570309960] [2022-12-06 07:35:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:42,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:42,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:42,699 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:42,700 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:42,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:42,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:42,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:42,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:42,714 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:42,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:42,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:42,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:42,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:42,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:42,751 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:42,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:42,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,776 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:42,776 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:42,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:42,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:42,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:42,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:42,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:35:42,929 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:42,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:42,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:42,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2022-12-06 07:35:42,929 INFO L420 AbstractCegarLoop]: === Iteration 1089 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1966489892, now seen corresponding path program 1 times [2022-12-06 07:35:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:42,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677127003] [2022-12-06 07:35:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,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:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677127003] [2022-12-06 07:35:42,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677127003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:42,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:42,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:42,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302068991] [2022-12-06 07:35:42,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:42,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:42,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:42,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:42,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:42,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:42,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,268 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:43,268 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:43,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:43,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:43,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:43,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:43,279 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:43,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:43,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:43,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,312 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,336 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:43,336 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:35:43,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:43,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:43,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:43,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:35:43,476 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:43,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:43,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:43,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2022-12-06 07:35:43,476 INFO L420 AbstractCegarLoop]: === Iteration 1090 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash -223679557, now seen corresponding path program 1 times [2022-12-06 07:35:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:43,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223206112] [2022-12-06 07:35:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:43,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:35:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:43,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223206112] [2022-12-06 07:35:43,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223206112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:43,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:43,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:43,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285975143] [2022-12-06 07:35:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:43,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:43,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:43,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:43,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:43,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:43,791 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:43,791 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:43,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:43,803 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:43,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:43,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:43,804 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:43,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:43,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:43,840 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:43,840 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:43,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:43,840 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:43,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:43,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,865 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:43,865 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:43,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:43,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:43,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:43,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:43,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:35:43,999 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:43,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:43,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:43,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2022-12-06 07:35:43,999 INFO L420 AbstractCegarLoop]: === Iteration 1091 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1519130778, now seen corresponding path program 1 times [2022-12-06 07:35:43,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:43,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124861307] [2022-12-06 07:35:43,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:43,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:44,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:35:44,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124861307] [2022-12-06 07:35:44,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124861307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827154074] [2022-12-06 07:35:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:44,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:44,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,345 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:44,345 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:44,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:44,358 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:44,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:44,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:44,359 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:44,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:44,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,393 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:44,394 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:44,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,394 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,427 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:44,427 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:44,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:44,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:44,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:44,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:35:44,578 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:44,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:44,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:44,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2022-12-06 07:35:44,578 INFO L420 AbstractCegarLoop]: === Iteration 1092 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1033026183, now seen corresponding path program 1 times [2022-12-06 07:35:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:44,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536615157] [2022-12-06 07:35:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:44,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:35:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:44,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536615157] [2022-12-06 07:35:44,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536615157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:44,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:44,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882930365] [2022-12-06 07:35:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:44,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:44,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:44,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:44,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:44,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:44,921 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:44,921 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:35:44,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:44,934 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:44,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:44,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:44,935 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:44,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:44,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:44,968 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:44,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:44,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:44,968 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:44,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:44,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,993 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:44,993 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:35:44,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:44,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:44,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:45,137 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:35:45,138 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:45,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2022-12-06 07:35:45,138 INFO L420 AbstractCegarLoop]: === Iteration 1093 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:45,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash 709784152, now seen corresponding path program 1 times [2022-12-06 07:35:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035824380] [2022-12-06 07:35:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,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:35:45,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035824380] [2022-12-06 07:35:45,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035824380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825571519] [2022-12-06 07:35:45,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:45,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:45,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:45,480 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:45,480 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:35:45,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:45,494 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:45,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:45,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:45,495 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:45,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:45,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:45,529 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:45,529 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:45,529 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:45,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:45,529 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:45,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:45,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:45,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:45,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:45,554 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:45,554 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:35:45,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:45,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:45,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:45,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:45,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:35:45,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:45,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:45,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:45,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2022-12-06 07:35:45,701 INFO L420 AbstractCegarLoop]: === Iteration 1094 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1842372809, now seen corresponding path program 1 times [2022-12-06 07:35:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:45,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826090773] [2022-12-06 07:35:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:45,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:35:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:45,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826090773] [2022-12-06 07:35:45,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826090773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:45,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:45,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367278040] [2022-12-06 07:35:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:45,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:45,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:45,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:45,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:45,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,031 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:46,031 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:46,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:46,045 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:46,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:46,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:46,046 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:46,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:46,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:46,081 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:46,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,081 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,107 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:46,108 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:35:46,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:46,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:46,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:35:46,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:46,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2022-12-06 07:35:46,255 INFO L420 AbstractCegarLoop]: === Iteration 1095 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,255 INFO L85 PathProgramCache]: Analyzing trace with hash -99562474, now seen corresponding path program 1 times [2022-12-06 07:35:46,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779727283] [2022-12-06 07:35:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,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:46,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779727283] [2022-12-06 07:35:46,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779727283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635429155] [2022-12-06 07:35:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:46,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:46,590 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:46,590 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:35:46,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:46,602 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:46,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:46,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:46,603 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:46,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:46,637 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:46,637 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:46,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:46,637 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:46,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:46,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,662 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:46,662 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:46,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:46,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:46,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:46,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:46,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:35:46,822 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:46,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:46,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:46,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2022-12-06 07:35:46,823 INFO L420 AbstractCegarLoop]: === Iteration 1096 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1643247861, now seen corresponding path program 1 times [2022-12-06 07:35:46,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:46,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109920082] [2022-12-06 07:35:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:46,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:35:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:46,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109920082] [2022-12-06 07:35:46,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109920082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:46,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:46,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235172243] [2022-12-06 07:35:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:46,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:46,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:46,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,161 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:47,161 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:47,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:47,173 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:47,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:47,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:47,174 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:47,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,206 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:47,206 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:47,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,206 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,231 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:47,231 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:35:47,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:47,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:47,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:35:47,373 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:47,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2022-12-06 07:35:47,374 INFO L420 AbstractCegarLoop]: === Iteration 1097 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -908909100, now seen corresponding path program 1 times [2022-12-06 07:35:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561542019] [2022-12-06 07:35:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:47,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:35:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561542019] [2022-12-06 07:35:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561542019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436596422] [2022-12-06 07:35:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:47,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:47,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:47,719 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:47,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:47,732 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:47,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:47,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:47,732 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:47,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:47,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,767 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:47,768 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:47,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,768 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,792 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:47,793 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:47,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:47,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:47,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:47,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-06 07:35:47,923 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:47,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2022-12-06 07:35:47,923 INFO L420 AbstractCegarLoop]: === Iteration 1098 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 833901235, now seen corresponding path program 1 times [2022-12-06 07:35:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265125505] [2022-12-06 07:35:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:47,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:47,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:47,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265125505] [2022-12-06 07:35:47,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265125505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:47,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:47,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886478398] [2022-12-06 07:35:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:47,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:47,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:47,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:47,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:47,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:47,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,250 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:48,251 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:48,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:48,264 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:48,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:48,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:48,264 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:48,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:48,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,317 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:48,318 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:48,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,318 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:48,348 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:35:48,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:48,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:48,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:48,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:35:48,506 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:48,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:48,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:48,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2022-12-06 07:35:48,506 INFO L420 AbstractCegarLoop]: === Iteration 1099 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1718255726, now seen corresponding path program 1 times [2022-12-06 07:35:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:48,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162320349] [2022-12-06 07:35:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162320349] [2022-12-06 07:35:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162320349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:48,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509957231] [2022-12-06 07:35:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:48,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:48,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:48,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:48,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:48,856 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:48,856 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:48,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:48,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:48,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:48,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:48,872 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:48,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:48,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:48,909 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:48,910 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:48,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:48,910 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:48,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:48,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,936 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:48,936 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:48,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:48,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:48,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:49,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:35:49,091 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:49,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2022-12-06 07:35:49,091 INFO L420 AbstractCegarLoop]: === Iteration 1100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash 24554609, now seen corresponding path program 1 times [2022-12-06 07:35:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64016154] [2022-12-06 07:35:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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:35:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64016154] [2022-12-06 07:35:49,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64016154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256135052] [2022-12-06 07:35:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:49,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:49,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:49,410 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:49,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:49,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:49,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:49,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:49,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:49,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:49,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:49,459 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:49,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:49,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:49,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:49,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:49,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:49,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:49,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:49,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:49,487 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:49,487 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:49,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:49,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:49,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:49,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:49,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:35:49,628 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:49,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:49,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:49,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2022-12-06 07:35:49,629 INFO L420 AbstractCegarLoop]: === Iteration 1101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1767364944, now seen corresponding path program 1 times [2022-12-06 07:35:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:49,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395424645] [2022-12-06 07:35:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:49,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:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:49,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395424645] [2022-12-06 07:35:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395424645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:49,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:49,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930462938] [2022-12-06 07:35:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:49,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:49,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:49,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:49,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:49,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:49,981 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:49,982 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:35:49,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:49,994 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:49,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:49,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:49,995 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:49,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:50,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,029 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:50,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:50,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,030 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,054 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:50,055 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:35:50,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:50,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:50,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:35:50,196 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:50,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2022-12-06 07:35:50,196 INFO L420 AbstractCegarLoop]: === Iteration 1102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash -784792017, now seen corresponding path program 1 times [2022-12-06 07:35:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143425402] [2022-12-06 07:35:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143425402] [2022-12-06 07:35:50,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143425402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796324574] [2022-12-06 07:35:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:50,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:50,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:50,520 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:50,520 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:50,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:50,534 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:50,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:50,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:50,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:50,535 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:50,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:50,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:50,573 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:50,573 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:50,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:50,573 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:50,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:50,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,598 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:50,599 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:35:50,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:50,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:50,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:50,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:50,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:35:50,764 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:50,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:50,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2022-12-06 07:35:50,765 INFO L420 AbstractCegarLoop]: === Iteration 1103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:50,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash 958018318, now seen corresponding path program 1 times [2022-12-06 07:35:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:50,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712225684] [2022-12-06 07:35:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35: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:35:50,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:50,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712225684] [2022-12-06 07:35:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712225684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:50,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:50,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110893651] [2022-12-06 07:35:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:50,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:50,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:50,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:50,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:50,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:50,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,101 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:51,101 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:51,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:51,114 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:51,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:51,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:51,115 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:51,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:51,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:51,149 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:51,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,149 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,173 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:51,174 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:35:51,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:51,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:51,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:35:51,318 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:51,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,319 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2022-12-06 07:35:51,319 INFO L420 AbstractCegarLoop]: === Iteration 1104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:51,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1594138643, now seen corresponding path program 1 times [2022-12-06 07:35:51,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068978995] [2022-12-06 07:35:51,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,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:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068978995] [2022-12-06 07:35:51,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068978995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668545960] [2022-12-06 07:35:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:51,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:51,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:51,646 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:51,646 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:51,659 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:51,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:51,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:51,660 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:51,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:51,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:51,695 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:51,696 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:51,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:51,696 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:51,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:51,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,720 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:51,721 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:35:51,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:51,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:51,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:51,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:51,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:35:51,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:51,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:51,894 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2022-12-06 07:35:51,894 INFO L420 AbstractCegarLoop]: === Iteration 1105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 148671692, now seen corresponding path program 1 times [2022-12-06 07:35:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387284366] [2022-12-06 07:35:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:51,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:51,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387284366] [2022-12-06 07:35:51,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387284366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:51,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:51,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020770642] [2022-12-06 07:35:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:51,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:51,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:51,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:51,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:51,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,263 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:52,263 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:52,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:52,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:52,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:52,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:52,279 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:52,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:52,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,313 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:52,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:52,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,313 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,338 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:52,338 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:35:52,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2956 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:52,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:52,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:52,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 07:35:52,504 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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, 1, 1, 1, 1, 1] [2022-12-06 07:35:52,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2022-12-06 07:35:52,505 INFO L420 AbstractCegarLoop]: === Iteration 1106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1891482027, now seen corresponding path program 1 times [2022-12-06 07:35:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:52,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726154097] [2022-12-06 07:35:52,505 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,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:52,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:35:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726154097] [2022-12-06 07:35:52,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726154097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:52,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:52,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202807423] [2022-12-06 07:35:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:52,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:52,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:52,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:52,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:52,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:52,852 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:52,852 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:35:52,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:52,864 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:52,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:52,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:52,865 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:52,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:52,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:52,898 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:52,898 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:52,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:52,898 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:52,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:52,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,923 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:52,923 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:35:52,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:52,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:52,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:53,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:35:53,060 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:53,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2022-12-06 07:35:53,060 INFO L420 AbstractCegarLoop]: === Iteration 1107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -660674934, now seen corresponding path program 1 times [2022-12-06 07:35:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370515978] [2022-12-06 07:35:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370515978] [2022-12-06 07:35:53,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370515978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106008283] [2022-12-06 07:35:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:53,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:53,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,391 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:53,391 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:53,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:53,404 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:53,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:53,405 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:53,405 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:53,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:53,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,440 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:53,441 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:53,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,441 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,465 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:53,465 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:35:53,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:53,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:53,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:53,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:35:53,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:53,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:53,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:53,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2022-12-06 07:35:53,624 INFO L420 AbstractCegarLoop]: === Iteration 1108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1082135401, now seen corresponding path program 1 times [2022-12-06 07:35:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060652556] [2022-12-06 07:35:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:53,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:35:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060652556] [2022-12-06 07:35:53,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060652556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:53,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:53,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368975082] [2022-12-06 07:35:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:53,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:53,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:53,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:53,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:53,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:53,941 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:53,942 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:53,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:53,954 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:53,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:53,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:53,955 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:53,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:53,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:53,988 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,988 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:53,988 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:53,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:53,988 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:53,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:53,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:53,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,012 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:54,012 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:35:54,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:54,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:54,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:35:54,167 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:54,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2022-12-06 07:35:54,168 INFO L420 AbstractCegarLoop]: === Iteration 1109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1470021560, now seen corresponding path program 1 times [2022-12-06 07:35:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626491157] [2022-12-06 07:35:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626491157] [2022-12-06 07:35:54,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626491157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356707563] [2022-12-06 07:35:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:54,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:54,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:54,533 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:54,533 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:35:54,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:54,546 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:54,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:54,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:54,546 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:54,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:54,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:54,582 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:54,582 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:54,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:54,582 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:54,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:54,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,607 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:54,607 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 07:35:54,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:54,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:54,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:54,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:54,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:35:54,750 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:54,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:54,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:54,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2022-12-06 07:35:54,750 INFO L420 AbstractCegarLoop]: === Iteration 1110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 272788775, now seen corresponding path program 1 times [2022-12-06 07:35:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:54,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833202176] [2022-12-06 07:35:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:54,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:35:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:54,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833202176] [2022-12-06 07:35:54,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833202176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:54,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:54,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733366917] [2022-12-06 07:35:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:54,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:54,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:54,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:54,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:54,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,093 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:55,094 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:35:55,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:55,106 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:55,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:55,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:55,106 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:55,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:55,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,141 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:55,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:55,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,142 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,166 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:55,167 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:35:55,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:55,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:55,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:35:55,317 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:55,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2022-12-06 07:35:55,318 INFO L420 AbstractCegarLoop]: === Iteration 1111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2015599110, now seen corresponding path program 1 times [2022-12-06 07:35:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036259217] [2022-12-06 07:35:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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:35:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036259217] [2022-12-06 07:35:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036259217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685876544] [2022-12-06 07:35:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:55,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:55,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:55,662 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:55,663 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:35:55,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:55,675 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:55,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:55,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:55,675 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:55,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:55,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:55,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:55,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:55,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:55,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:55,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:55,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,732 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:55,732 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:35:55,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:55,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:55,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:55,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:55,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:35:55,879 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:55,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:55,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:55,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2022-12-06 07:35:55,879 INFO L420 AbstractCegarLoop]: === Iteration 1112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash -536557851, now seen corresponding path program 1 times [2022-12-06 07:35:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:55,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643178658] [2022-12-06 07:35:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:55,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:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:55,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643178658] [2022-12-06 07:35:55,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643178658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:55,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:55,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354659170] [2022-12-06 07:35:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:55,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:55,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:55,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:55,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:55,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,228 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:56,229 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:56,240 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:56,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:56,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:56,241 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:56,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:56,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,274 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:56,274 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:56,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,299 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:56,299 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:35:56,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:56,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:56,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:35:56,441 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:56,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2022-12-06 07:35:56,441 INFO L420 AbstractCegarLoop]: === Iteration 1113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1206252484, now seen corresponding path program 1 times [2022-12-06 07:35:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119751165] [2022-12-06 07:35:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:56,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:35:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:56,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119751165] [2022-12-06 07:35:56,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119751165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:56,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:56,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62803937] [2022-12-06 07:35:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:56,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:56,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:56,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:56,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:56,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:56,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:56,755 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:56,755 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:35:56,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:56,768 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:56,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:56,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:56,769 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:56,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:56,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:56,802 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:56,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:56,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:56,803 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:56,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:56,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,828 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:56,828 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:35:56,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:56,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:56,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:56,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:56,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:35:56,979 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:56,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:56,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:56,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2022-12-06 07:35:56,979 INFO L420 AbstractCegarLoop]: === Iteration 1114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1345904477, now seen corresponding path program 1 times [2022-12-06 07:35:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:56,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375635439] [2022-12-06 07:35:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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:35:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375635439] [2022-12-06 07:35:57,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375635439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337080214] [2022-12-06 07:35:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:57,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:57,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:57,304 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:57,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:57,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:57,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:57,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:57,317 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:57,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:57,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:57,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:57,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,407 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:57,407 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:35:57,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:57,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:57,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:57,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:35:57,558 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:57,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:57,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:57,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2022-12-06 07:35:57,558 INFO L420 AbstractCegarLoop]: === Iteration 1115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 396905858, now seen corresponding path program 1 times [2022-12-06 07:35:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:57,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206040588] [2022-12-06 07:35:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:57,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:35:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206040588] [2022-12-06 07:35:57,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206040588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:57,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723884728] [2022-12-06 07:35:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:57,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:57,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:57,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:57,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:57,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:57,881 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:57,881 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:35:57,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:57,893 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:57,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:57,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:57,894 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:57,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:57,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:57,927 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:57,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:57,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:57,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:57,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:57,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,952 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:57,952 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:35:57,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:57,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:57,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:58,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:35:58,103 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:58,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2022-12-06 07:35:58,103 INFO L420 AbstractCegarLoop]: === Iteration 1116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2139716193, now seen corresponding path program 1 times [2022-12-06 07:35:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344603234] [2022-12-06 07:35:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,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:35:58,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344603234] [2022-12-06 07:35:58,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344603234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:58,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248042867] [2022-12-06 07:35:58,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:58,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:58,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:58,442 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:58,442 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:58,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:58,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:58,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:58,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:58,456 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:58,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:58,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:58,500 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:58,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:58,500 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:58,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:58,500 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:58,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:58,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:58,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:58,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:58,527 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:58,527 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:35:58,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:58,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:58,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:58,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:58,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:35:58,665 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:58,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:58,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:58,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2022-12-06 07:35:58,666 INFO L420 AbstractCegarLoop]: === Iteration 1117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:58,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash -412440768, now seen corresponding path program 1 times [2022-12-06 07:35:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:58,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800137819] [2022-12-06 07:35:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:58,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:35:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:58,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800137819] [2022-12-06 07:35:58,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800137819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:58,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:58,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388286478] [2022-12-06 07:35:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:58,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:58,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:58,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:58,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:58,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:58,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,013 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:59,014 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:35:59,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:59,026 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:59,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:59,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:59,027 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:59,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:59,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,064 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:59,064 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:59,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,064 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,089 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:35:59,089 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:35:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:35:59,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:59,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:59,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:35:59,245 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:59,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2022-12-06 07:35:59,245 INFO L420 AbstractCegarLoop]: === Iteration 1118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1330369567, now seen corresponding path program 1 times [2022-12-06 07:35:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765177472] [2022-12-06 07:35:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,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:35:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765177472] [2022-12-06 07:35:59,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765177472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474003883] [2022-12-06 07:35:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:59,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:59,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:59,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:35:59,587 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:35:59,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:35:59,600 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:35:59,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:35:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:35:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:35:59,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:35:59,601 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:35:59,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:35:59,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:59,635 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:35:59,635 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:35:59,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:59,635 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:59,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:59,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,660 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:35:59,660 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 07:35:59,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3288/3497 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:35:59,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:35:59,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:35:59,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:35:59,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 07:35:59,831 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:35:59,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:59,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:59,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2022-12-06 07:35:59,831 INFO L420 AbstractCegarLoop]: === Iteration 1119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1221787394, now seen corresponding path program 1 times [2022-12-06 07:35:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:59,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591892129] [2022-12-06 07:35:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:59,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:35:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:59,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591892129] [2022-12-06 07:35:59,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591892129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:35:59,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:35:59,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:35:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152092671] [2022-12-06 07:35:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:35:59,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:35:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:35:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:35:59,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:35:59,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:59,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:35:59,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,170 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:00,170 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:00,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:00,183 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:00,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:00,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:00,184 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:00,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:00,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,217 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:00,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:00,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,218 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,243 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:00,243 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:36:00,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:00,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:00,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 07:36:00,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:00,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2022-12-06 07:36:00,411 INFO L420 AbstractCegarLoop]: === Iteration 1120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 521022941, now seen corresponding path program 1 times [2022-12-06 07:36:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320529877] [2022-12-06 07:36:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:00,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:00,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:00,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320529877] [2022-12-06 07:36:00,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320529877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:00,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:00,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683271460] [2022-12-06 07:36:00,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:00,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:00,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:00,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:00,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:00,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:00,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:00,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:00,755 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:00,755 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:00,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:00,768 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:00,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:00,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:00,769 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:00,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:00,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:00,806 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:00,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:00,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:00,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:00,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,831 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:00,831 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:00,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:00,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:00,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:00,980 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:00,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:36:00,980 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:00,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:00,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:00,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2022-12-06 07:36:00,981 INFO L420 AbstractCegarLoop]: === Iteration 1121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2031134020, now seen corresponding path program 1 times [2022-12-06 07:36:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:00,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073583547] [2022-12-06 07:36:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:00,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,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:36:01,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073583547] [2022-12-06 07:36:01,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073583547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:01,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990695605] [2022-12-06 07:36:01,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:01,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:01,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:01,327 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:01,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:01,338 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:01,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:01,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:01,339 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:01,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:01,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,370 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:01,370 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:01,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,370 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,395 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:01,395 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:36:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2953 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:01,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:01,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:01,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:36:01,546 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:01,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:01,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:01,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2022-12-06 07:36:01,546 INFO L420 AbstractCegarLoop]: === Iteration 1122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash -288323685, now seen corresponding path program 1 times [2022-12-06 07:36:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:01,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126912154] [2022-12-06 07:36:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:01,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:01,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126912154] [2022-12-06 07:36:01,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126912154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:01,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:01,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277366575] [2022-12-06 07:36:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:01,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:01,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:01,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:01,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:01,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:01,897 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:01,897 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:01,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13555 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:01,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:01,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:01,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:01,911 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:01,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:01,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:01,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:01,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:01,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:01,946 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:01,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:01,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,973 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:01,973 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:01,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:01,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:01,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:02,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:02,117 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:02,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2022-12-06 07:36:02,118 INFO L420 AbstractCegarLoop]: === Iteration 1123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:02,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1454486650, now seen corresponding path program 1 times [2022-12-06 07:36:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189376956] [2022-12-06 07:36:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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:36:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189376956] [2022-12-06 07:36:02,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189376956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763630237] [2022-12-06 07:36:02,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:02,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:02,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:02,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:02,444 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:02,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:02,457 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:02,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:02,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:02,458 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:02,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:02,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:02,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:02,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:02,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:02,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:02,494 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:02,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:02,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:02,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:02,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:02,527 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:02,527 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:36:02,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:02,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:02,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:02,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:02,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:36:02,677 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:02,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:02,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:02,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2022-12-06 07:36:02,677 INFO L420 AbstractCegarLoop]: === Iteration 1124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1097670311, now seen corresponding path program 1 times [2022-12-06 07:36:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:02,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966478263] [2022-12-06 07:36:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:02,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:36:02,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:02,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966478263] [2022-12-06 07:36:02,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966478263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:02,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:02,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300169952] [2022-12-06 07:36:02,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:02,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:02,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:02,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:02,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:02,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:02,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:02,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:02,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,052 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:03,052 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:03,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:03,066 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:03,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:03,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:03,067 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:03,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:03,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,111 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:03,112 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:03,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,112 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,140 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:03,140 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:03,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:03,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:03,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:36:03,295 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:03,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2022-12-06 07:36:03,295 INFO L420 AbstractCegarLoop]: === Iteration 1125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 645140024, now seen corresponding path program 1 times [2022-12-06 07:36:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861924236] [2022-12-06 07:36:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861924236] [2022-12-06 07:36:03,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861924236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337685929] [2022-12-06 07:36:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:03,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:03,641 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:03,641 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:03,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:03,656 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:03,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:03,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:03,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:03,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:03,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:03,693 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:03,693 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:03,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:03,694 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:03,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:03,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,719 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:03,719 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:36:03,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:03,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:03,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:03,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:03,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:36:03,877 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:03,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:03,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:03,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2022-12-06 07:36:03,878 INFO L420 AbstractCegarLoop]: === Iteration 1126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1907016937, now seen corresponding path program 1 times [2022-12-06 07:36:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:03,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653571025] [2022-12-06 07:36:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:03,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:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653571025] [2022-12-06 07:36:03,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653571025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:03,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:03,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129406322] [2022-12-06 07:36:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:03,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:03,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:03,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:04,219 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:04,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:04,232 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:04,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:04,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:04,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:04,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:04,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,269 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:04,269 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:04,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,269 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,294 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:04,294 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:36:04,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:04,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:04,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:04,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:36:04,435 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:04,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:04,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:04,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2022-12-06 07:36:04,435 INFO L420 AbstractCegarLoop]: === Iteration 1127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash -164206602, now seen corresponding path program 1 times [2022-12-06 07:36:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:04,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720512826] [2022-12-06 07:36:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:04,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720512826] [2022-12-06 07:36:04,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720512826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:04,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:04,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005798505] [2022-12-06 07:36:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:04,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:04,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:04,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:04,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:04,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:04,787 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:04,787 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:04,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:04,800 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:04,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:04,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:04,801 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:04,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:04,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:04,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:04,845 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:04,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:04,845 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:04,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:04,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,870 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:04,870 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:04,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:04,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:04,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:05,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:36:05,018 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:05,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2022-12-06 07:36:05,018 INFO L420 AbstractCegarLoop]: === Iteration 1128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:05,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1578603733, now seen corresponding path program 1 times [2022-12-06 07:36:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868237690] [2022-12-06 07:36:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868237690] [2022-12-06 07:36:05,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868237690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525098195] [2022-12-06 07:36:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:05,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,368 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:05,368 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:05,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:05,380 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:05,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:05,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:05,380 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:05,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,413 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:05,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:05,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,413 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,438 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:05,438 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:05,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:05,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:05,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:05,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:05,582 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:05,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:05,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:05,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2022-12-06 07:36:05,582 INFO L420 AbstractCegarLoop]: === Iteration 1129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash -973553228, now seen corresponding path program 1 times [2022-12-06 07:36:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:05,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089509820] [2022-12-06 07:36:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:05,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:36:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089509820] [2022-12-06 07:36:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089509820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:05,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934932391] [2022-12-06 07:36:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:05,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:05,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:05,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:05,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:05,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:05,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:05,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:05,910 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:05,910 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:05,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:05,923 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:05,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:05,923 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 69 transitions. [2022-12-06 07:36:05,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:05,924 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:05,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:05,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:05,958 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:05,958 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:05,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:05,958 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:05,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:05,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:05,983 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:36:05,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:05,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:05,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:06,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:36:06,132 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:06,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2022-12-06 07:36:06,132 INFO L420 AbstractCegarLoop]: === Iteration 1130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,133 INFO L85 PathProgramCache]: Analyzing trace with hash 769257107, now seen corresponding path program 1 times [2022-12-06 07:36:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165356909] [2022-12-06 07:36:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,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:36:06,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165356909] [2022-12-06 07:36:06,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165356909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968775675] [2022-12-06 07:36:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:06,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:06,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:06,485 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:06,485 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:06,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:06,495 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:06,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:06,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:06,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:06,496 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:06,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:06,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:06,525 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:06,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:06,525 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:06,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:06,525 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:06,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:06,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:06,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:06,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:06,551 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:06,551 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:36:06,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:06,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:06,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:06,701 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:06,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:36:06,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:06,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:06,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:06,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2022-12-06 07:36:06,702 INFO L420 AbstractCegarLoop]: === Iteration 1131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1782899854, now seen corresponding path program 1 times [2022-12-06 07:36:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:06,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639676898] [2022-12-06 07:36:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:06,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:36:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:06,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639676898] [2022-12-06 07:36:06,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639676898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:06,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:06,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959896873] [2022-12-06 07:36:06,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:06,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:06,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:06,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:06,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:06,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:06,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,046 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:07,046 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:07,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:07,059 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:07,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:07,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:07,060 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:07,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:07,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:07,095 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:07,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,095 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,119 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:07,120 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:07,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:07,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:07,270 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:36:07,270 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:07,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2022-12-06 07:36:07,271 INFO L420 AbstractCegarLoop]: === Iteration 1132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash -40089519, now seen corresponding path program 1 times [2022-12-06 07:36:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172370719] [2022-12-06 07:36:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,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:36:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172370719] [2022-12-06 07:36:07,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172370719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162772038] [2022-12-06 07:36:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:07,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:07,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:07,612 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:07,612 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:07,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13554 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:07,625 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:07,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:07,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:07,626 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:07,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:07,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:07,662 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:07,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:07,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:07,662 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:07,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:07,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,687 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:07,687 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:07,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:07,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:07,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:07,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:07,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:07,834 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:07,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:07,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:07,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2022-12-06 07:36:07,834 INFO L420 AbstractCegarLoop]: === Iteration 1133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1702720816, now seen corresponding path program 1 times [2022-12-06 07:36:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:07,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716220719] [2022-12-06 07:36:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:07,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716220719] [2022-12-06 07:36:07,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716220719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:07,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:07,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411478391] [2022-12-06 07:36:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:07,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:07,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:07,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:07,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,162 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:08,162 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:08,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:08,174 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:08,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:08,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:08,175 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:08,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:08,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,208 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:08,208 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:08,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,209 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,233 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:08,233 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:36:08,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:08,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:08,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:36:08,389 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:08,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2022-12-06 07:36:08,389 INFO L420 AbstractCegarLoop]: === Iteration 1134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash -849436145, now seen corresponding path program 1 times [2022-12-06 07:36:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325320729] [2022-12-06 07:36:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:08,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:36:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:08,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325320729] [2022-12-06 07:36:08,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325320729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:08,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:08,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604676433] [2022-12-06 07:36:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:08,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:08,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:08,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:08,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:08,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:08,732 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:08,732 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13531 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:08,745 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:08,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:08,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:08,746 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:08,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:08,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:08,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:08,780 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:08,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:08,781 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:08,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:08,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,805 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:08,805 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:08,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:08,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:08,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:08,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:08,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:36:08,945 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:08,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:08,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:08,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2022-12-06 07:36:08,945 INFO L420 AbstractCegarLoop]: === Iteration 1135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash 893374190, now seen corresponding path program 1 times [2022-12-06 07:36:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393295212] [2022-12-06 07:36:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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:36:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393295212] [2022-12-06 07:36:09,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393295212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777848157] [2022-12-06 07:36:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:09,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:09,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,308 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:09,308 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:36:09,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:09,321 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:09,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:09,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:09,321 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:09,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:09,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,355 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:09,355 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:09,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,355 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,380 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:09,380 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:36:09,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:09,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:09,535 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:09,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:36:09,535 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:09,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:09,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:09,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2022-12-06 07:36:09,535 INFO L420 AbstractCegarLoop]: === Iteration 1136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1658782771, now seen corresponding path program 1 times [2022-12-06 07:36:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:09,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752977221] [2022-12-06 07:36:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:09,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:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:09,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752977221] [2022-12-06 07:36:09,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752977221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:09,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:09,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:09,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846769296] [2022-12-06 07:36:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:09,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:09,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:09,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:09,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:09,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:09,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:09,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:09,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:09,860 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:09,860 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:09,873 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:09,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:09,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:09,874 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:09,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:09,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:09,909 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:09,909 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:09,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:09,909 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:09,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:09,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,934 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:09,935 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:09,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:09,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:09,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:10,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:36:10,075 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:10,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,075 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2022-12-06 07:36:10,075 INFO L420 AbstractCegarLoop]: === Iteration 1137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash 84027564, now seen corresponding path program 1 times [2022-12-06 07:36:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033570048] [2022-12-06 07:36:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033570048] [2022-12-06 07:36:10,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033570048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739207296] [2022-12-06 07:36:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:10,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:10,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:10,425 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:10,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:10,436 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:10,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:10,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:10,437 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:10,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:10,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:10,466 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:10,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:10,467 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:10,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:10,467 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:10,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:10,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:10,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:10,491 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:10,491 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:36:10,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:10,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:10,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:10,638 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:10,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:10,638 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:10,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:10,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:10,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2022-12-06 07:36:10,639 INFO L420 AbstractCegarLoop]: === Iteration 1138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1826837899, now seen corresponding path program 1 times [2022-12-06 07:36:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:10,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308610208] [2022-12-06 07:36:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:10,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:36:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308610208] [2022-12-06 07:36:10,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308610208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:10,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:10,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072566184] [2022-12-06 07:36:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:10,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:10,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:10,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:10,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:10,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:10,976 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:10,976 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:10,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:10,988 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:10,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:10,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:10,989 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:10,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:11,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,024 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:11,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:11,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,050 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:11,050 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:11,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:11,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:11,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:36:11,195 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:11,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2022-12-06 07:36:11,196 INFO L420 AbstractCegarLoop]: === Iteration 1139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -725319062, now seen corresponding path program 1 times [2022-12-06 07:36:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585733669] [2022-12-06 07:36:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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:36:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585733669] [2022-12-06 07:36:11,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585733669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952508090] [2022-12-06 07:36:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:11,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:11,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:11,528 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:11,528 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:11,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:11,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:11,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:11,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:11,541 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:11,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:11,574 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:11,574 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:11,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:11,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:11,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:11,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:11,604 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 07:36:11,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:11,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:11,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:11,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:11,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:36:11,742 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:11,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:11,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:11,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2022-12-06 07:36:11,742 INFO L420 AbstractCegarLoop]: === Iteration 1140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1017491273, now seen corresponding path program 1 times [2022-12-06 07:36:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:11,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035083081] [2022-12-06 07:36:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:11,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:36:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:11,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035083081] [2022-12-06 07:36:11,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035083081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:11,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:11,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835392702] [2022-12-06 07:36:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:11,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:11,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:11,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:11,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:11,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:12,057 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:12,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:12,069 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:12,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:12,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:12,070 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:12,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:12,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:12,104 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:12,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,104 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,104 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,128 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:12,129 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:36:12,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:12,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:12,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:12,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:12,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2022-12-06 07:36:12,273 INFO L420 AbstractCegarLoop]: === Iteration 1141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1534665688, now seen corresponding path program 1 times [2022-12-06 07:36:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434470637] [2022-12-06 07:36:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:12,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:36:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434470637] [2022-12-06 07:36:12,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434470637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559317657] [2022-12-06 07:36:12,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:12,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:12,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:12,600 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:12,600 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:12,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:12,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:12,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:12,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:12,613 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:12,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:12,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:12,647 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:12,647 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:12,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:12,648 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:12,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:12,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,673 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:12,673 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:36:12,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:12,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:12,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:12,831 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:12,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:36:12,832 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:12,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:12,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:12,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2022-12-06 07:36:12,832 INFO L420 AbstractCegarLoop]: === Iteration 1142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash 208144647, now seen corresponding path program 1 times [2022-12-06 07:36:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:12,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955685555] [2022-12-06 07:36:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:12,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:36:12,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:12,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955685555] [2022-12-06 07:36:12,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955685555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:12,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:12,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492909052] [2022-12-06 07:36:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:12,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:12,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:12,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:12,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:12,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,184 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:13,184 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:13,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:13,197 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:13,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:13,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:13,198 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:13,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:13,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:13,233 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:13,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,233 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,233 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,258 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:13,258 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:13,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:13,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:13,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:36:13,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:13,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2022-12-06 07:36:13,414 INFO L420 AbstractCegarLoop]: === Iteration 1143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1950954982, now seen corresponding path program 1 times [2022-12-06 07:36:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124301489] [2022-12-06 07:36:13,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:13,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:36:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:13,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124301489] [2022-12-06 07:36:13,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124301489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:13,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:13,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:13,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522057096] [2022-12-06 07:36:13,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:13,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:13,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:13,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:13,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:13,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:13,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:13,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:13,775 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:13,775 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:13,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:13,788 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:13,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:13,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:13,789 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:13,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:13,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:13,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:13,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:13,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:13,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:13,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:13,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,848 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:13,848 INFO L131 PetriNetUnfolder]: For 3297/3507 co-relation queries the response was YES. [2022-12-06 07:36:13,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3297/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:13,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:13,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:13,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:13,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:36:13,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:13,988 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:13,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2022-12-06 07:36:13,988 INFO L420 AbstractCegarLoop]: === Iteration 1144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash -601201979, now seen corresponding path program 1 times [2022-12-06 07:36:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:13,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331060367] [2022-12-06 07:36:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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:36:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331060367] [2022-12-06 07:36:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331060367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881072356] [2022-12-06 07:36:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:14,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,341 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:14,341 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:14,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:14,353 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:14,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:14,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:14,354 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:14,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:14,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:14,386 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:14,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,386 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,411 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:14,411 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:14,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:14,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:14,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:14,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:36:14,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:14,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:14,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:14,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2022-12-06 07:36:14,556 INFO L420 AbstractCegarLoop]: === Iteration 1145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1141608356, now seen corresponding path program 1 times [2022-12-06 07:36:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985375101] [2022-12-06 07:36:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:14,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:36:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985375101] [2022-12-06 07:36:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985375101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:14,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:14,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584476284] [2022-12-06 07:36:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:14,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:14,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:14,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:14,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:14,868 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:14,868 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:14,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:14,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:14,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:14,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:14,881 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:14,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:14,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:14,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:14,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:14,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:14,914 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:14,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,938 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:14,939 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:36:14,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:14,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:14,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:15,077 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:36:15,078 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:15,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2022-12-06 07:36:15,078 INFO L420 AbstractCegarLoop]: === Iteration 1146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:15,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1410548605, now seen corresponding path program 1 times [2022-12-06 07:36:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954246486] [2022-12-06 07:36:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954246486] [2022-12-06 07:36:15,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954246486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899867239] [2022-12-06 07:36:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:15,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:15,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:15,420 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:15,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:15,430 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:15,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:15,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:15,431 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:15,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:15,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:15,459 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:15,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:15,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:15,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:15,460 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:15,460 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:15,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:15,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:15,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:15,484 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:15,485 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:15,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:15,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:15,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:15,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:15,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:36:15,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:15,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:15,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:15,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2022-12-06 07:36:15,634 INFO L420 AbstractCegarLoop]: === Iteration 1147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash 332261730, now seen corresponding path program 1 times [2022-12-06 07:36:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:15,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210699177] [2022-12-06 07:36:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:15,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210699177] [2022-12-06 07:36:15,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210699177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:15,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:15,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763706029] [2022-12-06 07:36:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:15,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:15,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:15,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:15,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:15,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:15,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:15,960 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:36:15,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:15,972 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:15,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:15,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:15,972 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:15,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:16,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,005 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:16,005 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:16,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,006 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,030 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:16,030 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:36:16,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:16,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:16,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:36:16,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:16,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2022-12-06 07:36:16,185 INFO L420 AbstractCegarLoop]: === Iteration 1148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2075072065, now seen corresponding path program 1 times [2022-12-06 07:36:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33589240] [2022-12-06 07:36:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,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:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33589240] [2022-12-06 07:36:16,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33589240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468484577] [2022-12-06 07:36:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:16,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:16,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:16,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:16,502 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:16,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:16,514 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:16,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:16,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:16,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:16,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:16,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:16,548 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:16,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:16,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:16,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:16,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:16,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,573 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:16,573 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:36:16,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:16,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:16,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:16,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:16,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:16,720 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:16,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2022-12-06 07:36:16,721 INFO L420 AbstractCegarLoop]: === Iteration 1149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash -477084896, now seen corresponding path program 1 times [2022-12-06 07:36:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710805200] [2022-12-06 07:36:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,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:16,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710805200] [2022-12-06 07:36:16,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710805200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598601995] [2022-12-06 07:36:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:16,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:16,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,049 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:17,049 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:17,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:17,061 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:17,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:17,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:17,062 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:17,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:17,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,096 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:17,096 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:17,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,096 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,121 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:17,122 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:36:17,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3016 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:17,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:17,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:17,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:17,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2022-12-06 07:36:17,267 INFO L420 AbstractCegarLoop]: === Iteration 1150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1265725439, now seen corresponding path program 1 times [2022-12-06 07:36:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000769831] [2022-12-06 07:36:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,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:36:17,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000769831] [2022-12-06 07:36:17,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000769831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533951181] [2022-12-06 07:36:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:17,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:17,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,585 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:17,585 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:17,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:17,598 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:17,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:17,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:17,598 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:17,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:17,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:17,632 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:17,632 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:17,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,632 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,657 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:17,657 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:17,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:17,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:17,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:17,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:36:17,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:17,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2022-12-06 07:36:17,791 INFO L420 AbstractCegarLoop]: === Iteration 1151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1286431522, now seen corresponding path program 1 times [2022-12-06 07:36:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617351242] [2022-12-06 07:36:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,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:36:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617351242] [2022-12-06 07:36:17,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617351242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30652962] [2022-12-06 07:36:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:17,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:17,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,157 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:18,157 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:18,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:18,169 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:18,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:18,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:18,170 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:18,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:18,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,203 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:18,204 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:18,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,204 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,229 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:18,229 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:18,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:18,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:18,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:36:18,371 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:18,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2022-12-06 07:36:18,372 INFO L420 AbstractCegarLoop]: === Iteration 1152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:18,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 456378813, now seen corresponding path program 1 times [2022-12-06 07:36:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963269696] [2022-12-06 07:36:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,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:36:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963269696] [2022-12-06 07:36:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963269696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977643122] [2022-12-06 07:36:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:18,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:18,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:18,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:18,695 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:18,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:18,707 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:18,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:18,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:18,708 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:18,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:18,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:18,742 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:18,742 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:18,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:18,742 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:18,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:18,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,766 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:18,766 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:36:18,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:18,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:18,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:18,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:18,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:36:18,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:18,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:18,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:18,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2022-12-06 07:36:18,901 INFO L420 AbstractCegarLoop]: === Iteration 1153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2095778148, now seen corresponding path program 1 times [2022-12-06 07:36:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942381854] [2022-12-06 07:36:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,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:36:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942381854] [2022-12-06 07:36:18,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942381854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:18,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:18,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857490278] [2022-12-06 07:36:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:18,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:18,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:18,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:18,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:18,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:18,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,244 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:19,244 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:19,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:19,254 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:19,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:19,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:19,254 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:19,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:19,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,283 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:19,284 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:19,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,284 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,308 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:19,308 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:36:19,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:19,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:19,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:19,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:19,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2022-12-06 07:36:19,457 INFO L420 AbstractCegarLoop]: === Iteration 1154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -352967813, now seen corresponding path program 1 times [2022-12-06 07:36:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384281267] [2022-12-06 07:36:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384281267] [2022-12-06 07:36:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384281267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906124696] [2022-12-06 07:36:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:19,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:19,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:19,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:19,788 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:19,788 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:19,801 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:19,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:19,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:19,801 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:19,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:19,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:19,836 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:19,836 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:19,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:19,837 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:19,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:19,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,861 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:19,861 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:19,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:19,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:19,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:19,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:19,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:36:19,995 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:19,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:19,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:19,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2022-12-06 07:36:19,995 INFO L420 AbstractCegarLoop]: === Iteration 1155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1389842522, now seen corresponding path program 1 times [2022-12-06 07:36:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:19,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127604265] [2022-12-06 07:36:19,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:19,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:20,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127604265] [2022-12-06 07:36:20,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127604265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903339505] [2022-12-06 07:36:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:20,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:20,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,313 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:20,313 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:20,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:20,326 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:20,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:20,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:20,327 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:20,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:20,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,362 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:20,362 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:20,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,362 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,395 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:20,395 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:36:20,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:20,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:20,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:20,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:36:20,545 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:20,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:20,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:20,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2022-12-06 07:36:20,545 INFO L420 AbstractCegarLoop]: === Iteration 1156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1162314439, now seen corresponding path program 1 times [2022-12-06 07:36:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:20,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975906800] [2022-12-06 07:36:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:20,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:36:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:20,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975906800] [2022-12-06 07:36:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975906800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:20,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:20,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138716895] [2022-12-06 07:36:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:20,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:20,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:20,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:20,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:20,883 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:20,884 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:20,897 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:20,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:20,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:20,897 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:20,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:20,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:20,935 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:20,935 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:20,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:20,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:20,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:20,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,961 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:20,961 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:36:20,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:20,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:20,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:21,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:36:21,099 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:21,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2022-12-06 07:36:21,099 INFO L420 AbstractCegarLoop]: === Iteration 1157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash 580495896, now seen corresponding path program 1 times [2022-12-06 07:36:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531538979] [2022-12-06 07:36:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:21,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:21,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531538979] [2022-12-06 07:36:21,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531538979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689890347] [2022-12-06 07:36:21,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:21,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:21,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:21,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:21,444 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:21,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:21,459 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:21,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:21,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:21,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:21,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:21,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:21,492 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:21,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:21,493 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:21,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:21,493 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:21,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:21,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:21,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:21,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:21,518 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:21,519 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:36:21,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:21,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:21,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:21,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:21,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:21,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:21,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:21,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:21,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2022-12-06 07:36:21,664 INFO L420 AbstractCegarLoop]: === Iteration 1158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1971661065, now seen corresponding path program 1 times [2022-12-06 07:36:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:21,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558953411] [2022-12-06 07:36:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:21,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:36:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:21,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558953411] [2022-12-06 07:36:21,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558953411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:21,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:21,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633127568] [2022-12-06 07:36:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:21,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:21,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:21,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:21,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:21,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,015 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:22,015 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:36:22,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:22,027 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:22,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:22,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:22,028 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:22,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:22,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,062 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:22,062 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:22,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,062 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,088 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:22,088 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3011 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:22,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:22,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:36:22,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2022-12-06 07:36:22,229 INFO L420 AbstractCegarLoop]: === Iteration 1159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash -228850730, now seen corresponding path program 1 times [2022-12-06 07:36:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793676579] [2022-12-06 07:36:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,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:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793676579] [2022-12-06 07:36:22,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793676579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098428365] [2022-12-06 07:36:22,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:22,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,568 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:22,569 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:22,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:22,582 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:22,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:22,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:22,582 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:22,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:22,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,617 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:22,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:22,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,617 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,642 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:22,642 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:22,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:22,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:22,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:22,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:22,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:36:22,805 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:22,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:22,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:22,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2022-12-06 07:36:22,806 INFO L420 AbstractCegarLoop]: === Iteration 1160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1513959605, now seen corresponding path program 1 times [2022-12-06 07:36:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:22,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969616942] [2022-12-06 07:36:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:22,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:36:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:22,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969616942] [2022-12-06 07:36:22,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969616942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:22,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:22,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707811458] [2022-12-06 07:36:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:22,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:22,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:22,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:22,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,202 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:23,202 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:23,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:23,214 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:23,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:23,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:23,215 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:23,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:23,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,248 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:23,248 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:23,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,248 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,273 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:23,273 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:36:23,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:23,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:23,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:23,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:36:23,416 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:23,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:23,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:23,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2022-12-06 07:36:23,416 INFO L420 AbstractCegarLoop]: === Iteration 1161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1038197356, now seen corresponding path program 1 times [2022-12-06 07:36:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:23,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457610942] [2022-12-06 07:36:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:23,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:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457610942] [2022-12-06 07:36:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457610942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:23,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057345506] [2022-12-06 07:36:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:23,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:23,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:23,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:23,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:23,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:23,747 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:23,747 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:36:23,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:23,759 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:23,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:23,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:23,760 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:23,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:23,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:23,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:23,792 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:23,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:23,792 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:23,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:23,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:23,817 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:36:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:23,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:23,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:23,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:23,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:36:23,969 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:23,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:23,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:23,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2022-12-06 07:36:23,969 INFO L420 AbstractCegarLoop]: === Iteration 1162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 704612979, now seen corresponding path program 1 times [2022-12-06 07:36:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:23,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931794948] [2022-12-06 07:36:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,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:36:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931794948] [2022-12-06 07:36:24,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931794948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540052863] [2022-12-06 07:36:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:24,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:24,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,373 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:24,374 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:24,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:24,412 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:24,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:24,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:24,412 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:24,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:24,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:24,442 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:24,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:24,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:24,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:24,442 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:24,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:24,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:24,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:24,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:24,467 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:24,467 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:36:24,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:24,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:24,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:24,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:24,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:36:24,622 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:24,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:24,622 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:24,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2022-12-06 07:36:24,623 INFO L420 AbstractCegarLoop]: === Iteration 1163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1847543982, now seen corresponding path program 1 times [2022-12-06 07:36:24,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:24,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761287705] [2022-12-06 07:36:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:24,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:36:24,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:24,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761287705] [2022-12-06 07:36:24,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761287705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:24,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:24,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184901670] [2022-12-06 07:36:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:24,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:24,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:24,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:24,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:24,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:24,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:24,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:24,956 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:24,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:24,968 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:24,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:24,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:24,969 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:24,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:25,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,003 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:25,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:25,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,003 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,028 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:25,028 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:36:25,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:25,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:25,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:36:25,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:25,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2022-12-06 07:36:25,162 INFO L420 AbstractCegarLoop]: === Iteration 1164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -104733647, now seen corresponding path program 1 times [2022-12-06 07:36:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254449921] [2022-12-06 07:36:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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:36:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254449921] [2022-12-06 07:36:25,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254449921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68901342] [2022-12-06 07:36:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:25,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:25,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:25,501 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:25,501 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:25,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:25,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:25,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:25,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:25,514 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:25,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:25,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:25,546 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:25,546 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:25,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:25,546 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:25,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:25,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,571 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:25,571 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:36:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:25,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:25,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:25,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:25,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:36:25,721 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:25,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:25,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:25,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2022-12-06 07:36:25,722 INFO L420 AbstractCegarLoop]: === Iteration 1165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1638076688, now seen corresponding path program 1 times [2022-12-06 07:36:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:25,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706902614] [2022-12-06 07:36:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:25,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:36:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706902614] [2022-12-06 07:36:25,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706902614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:25,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:25,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510852370] [2022-12-06 07:36:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:25,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:25,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:25,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:25,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:25,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:26,037 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:36:26,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:26,053 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:26,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:26,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:26,054 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:26,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:26,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,090 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:26,090 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:26,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,090 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,115 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:26,115 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:36:26,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:26,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:26,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:26,259 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:26,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2022-12-06 07:36:26,260 INFO L420 AbstractCegarLoop]: === Iteration 1166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -914080273, now seen corresponding path program 1 times [2022-12-06 07:36:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094750885] [2022-12-06 07:36:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094750885] [2022-12-06 07:36:26,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094750885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416495479] [2022-12-06 07:36:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:26,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:26,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:26,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:26,595 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:36:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:26,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:26,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:26,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:26,609 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:26,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:26,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:26,644 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:26,644 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:26,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:26,644 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:26,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:26,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,668 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:26,669 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:26,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:26,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:26,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:26,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:26,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:26,813 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:26,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:26,813 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:26,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2022-12-06 07:36:26,813 INFO L420 AbstractCegarLoop]: === Iteration 1167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:26,814 INFO L85 PathProgramCache]: Analyzing trace with hash 828730062, now seen corresponding path program 1 times [2022-12-06 07:36:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:26,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530701450] [2022-12-06 07:36:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:26,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:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530701450] [2022-12-06 07:36:26,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530701450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:26,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:26,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185278011] [2022-12-06 07:36:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:26,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:26,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:26,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:26,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:26,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:26,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,146 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:27,146 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:27,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:27,158 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:27,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:27,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:27,158 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:27,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,191 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:27,191 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:27,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,191 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,215 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:27,215 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:36:27,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:27,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:27,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 07:36:27,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:27,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2022-12-06 07:36:27,340 INFO L420 AbstractCegarLoop]: === Iteration 1168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1723426899, now seen corresponding path program 1 times [2022-12-06 07:36:27,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113077668] [2022-12-06 07:36:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:27,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:36:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113077668] [2022-12-06 07:36:27,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113077668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250439869] [2022-12-06 07:36:27,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:27,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:27,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:27,662 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:27,662 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:27,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:27,675 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:27,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:27,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:27,676 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:27,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:27,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:27,712 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:27,712 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:27,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:27,712 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:27,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:27,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,737 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:27,737 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:27,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2956 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:27,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:27,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:27,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:27,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:36:27,896 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:27,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2022-12-06 07:36:27,896 INFO L420 AbstractCegarLoop]: === Iteration 1169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash 19383436, now seen corresponding path program 1 times [2022-12-06 07:36:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899703065] [2022-12-06 07:36:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:27,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:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899703065] [2022-12-06 07:36:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899703065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:27,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:27,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583246590] [2022-12-06 07:36:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:27,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:27,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:27,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:27,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:27,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,232 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:28,232 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:28,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:28,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:28,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:28,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:28,243 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:28,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:28,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:28,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:28,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,273 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,298 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:28,298 INFO L131 PetriNetUnfolder]: For 3141/3284 co-relation queries the response was YES. [2022-12-06 07:36:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3141/3284 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:28,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:28,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:36:28,443 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:28,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2022-12-06 07:36:28,444 INFO L420 AbstractCegarLoop]: === Iteration 1170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:28,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1762193771, now seen corresponding path program 1 times [2022-12-06 07:36:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531447099] [2022-12-06 07:36:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:28,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:36:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:28,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531447099] [2022-12-06 07:36:28,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531447099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:28,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:28,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:28,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597431981] [2022-12-06 07:36:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:28,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:28,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:28,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:28,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:28,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:28,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:28,780 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:28,780 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:28,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:28,793 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:28,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:28,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:28,794 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:28,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:28,829 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:28,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:28,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:28,829 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:28,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:28,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,854 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:28,855 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:28,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:28,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:28,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:28,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:28,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:36:28,995 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:28,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:28,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:28,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2022-12-06 07:36:28,995 INFO L420 AbstractCegarLoop]: === Iteration 1171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash -789963190, now seen corresponding path program 1 times [2022-12-06 07:36:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:28,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533411751] [2022-12-06 07:36:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533411751] [2022-12-06 07:36:29,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533411751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420171657] [2022-12-06 07:36:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:29,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:29,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,331 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:29,331 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:29,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:29,344 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:29,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:29,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:29,345 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:29,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:29,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,376 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:29,377 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:29,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,377 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,408 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:29,408 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:36:29,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:29,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:29,561 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:29,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:36:29,562 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:29,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:29,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:29,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2022-12-06 07:36:29,562 INFO L420 AbstractCegarLoop]: === Iteration 1172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash 952847145, now seen corresponding path program 1 times [2022-12-06 07:36:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:29,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566077488] [2022-12-06 07:36:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:29,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:36:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566077488] [2022-12-06 07:36:29,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566077488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:29,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:29,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550617338] [2022-12-06 07:36:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:29,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:29,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:29,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:29,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:29,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:29,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:29,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:29,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:29,916 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:29,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:29,929 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:29,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:29,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:29,930 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:29,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:29,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:29,965 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:29,965 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:29,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:29,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:29,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:29,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,991 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:29,992 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:29,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:29,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:29,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:30,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:36:30,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:30,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2022-12-06 07:36:30,130 INFO L420 AbstractCegarLoop]: === Iteration 1173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1599309816, now seen corresponding path program 1 times [2022-12-06 07:36:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137567843] [2022-12-06 07:36:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137567843] [2022-12-06 07:36:30,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137567843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026325370] [2022-12-06 07:36:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:30,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:30,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:30,466 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:30,466 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:30,482 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:30,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:30,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:30,482 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:30,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:30,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:30,517 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:30,517 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:30,517 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:30,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:30,517 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:30,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:30,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:30,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:30,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:30,542 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:30,542 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:36:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:30,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:30,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:30,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:30,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:36:30,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:30,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:30,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:30,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2022-12-06 07:36:30,678 INFO L420 AbstractCegarLoop]: === Iteration 1174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 143500519, now seen corresponding path program 1 times [2022-12-06 07:36:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:30,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918886078] [2022-12-06 07:36:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:30,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:36:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:30,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918886078] [2022-12-06 07:36:30,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918886078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:30,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:30,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471473343] [2022-12-06 07:36:30,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:30,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:30,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:30,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:30,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:30,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:30,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:30,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,008 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:31,008 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:31,021 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:31,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:31,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:31,022 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:31,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:31,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,057 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:31,057 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:31,057 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,057 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,082 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:31,082 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:36:31,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:31,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:31,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:36:31,221 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:31,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2022-12-06 07:36:31,222 INFO L420 AbstractCegarLoop]: === Iteration 1175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1886310854, now seen corresponding path program 1 times [2022-12-06 07:36:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846718383] [2022-12-06 07:36:31,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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:36:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846718383] [2022-12-06 07:36:31,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846718383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889849986] [2022-12-06 07:36:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:31,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:31,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:31,564 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:31,564 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:36:31,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13502 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:31,577 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:31,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:31,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:31,578 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:31,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:31,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:31,609 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:31,609 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:31,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:31,609 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:31,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:31,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,634 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:31,634 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:36:31,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:31,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:31,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:31,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:31,787 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:36:31,787 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:31,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:31,787 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:31,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2022-12-06 07:36:31,787 INFO L420 AbstractCegarLoop]: === Iteration 1176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash -665846107, now seen corresponding path program 1 times [2022-12-06 07:36:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:31,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491183005] [2022-12-06 07:36:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:31,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:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491183005] [2022-12-06 07:36:31,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491183005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:31,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:31,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156686257] [2022-12-06 07:36:31,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:31,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:31,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:31,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:31,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,147 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:32,147 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:32,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:32,159 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:32,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:32,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:32,160 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:32,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:32,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,199 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,199 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:32,199 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:32,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,199 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,224 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:32,225 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:36:32,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:32,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:32,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:36:32,374 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:32,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175 [2022-12-06 07:36:32,374 INFO L420 AbstractCegarLoop]: === Iteration 1177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1076964228, now seen corresponding path program 1 times [2022-12-06 07:36:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037502740] [2022-12-06 07:36:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037502740] [2022-12-06 07:36:32,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037502740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313835911] [2022-12-06 07:36:32,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:32,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:32,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:32,701 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:32,701 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:32,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:32,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:32,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:32,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:32,714 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:32,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:32,748 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:32,748 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:32,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:32,748 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:32,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:32,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,773 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:32,773 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:36:32,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:32,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:32,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:32,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:32,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:36:32,915 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:32,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:32,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1176 [2022-12-06 07:36:32,915 INFO L420 AbstractCegarLoop]: === Iteration 1178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1475192733, now seen corresponding path program 1 times [2022-12-06 07:36:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:32,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871217804] [2022-12-06 07:36:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:32,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:36:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871217804] [2022-12-06 07:36:32,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871217804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:32,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:32,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612278197] [2022-12-06 07:36:32,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:32,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:32,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:32,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:32,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:32,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:32,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:32,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,238 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:33,238 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:36:33,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:33,250 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:33,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:33,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:33,251 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:33,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,303 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:33,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:33,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,304 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,328 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:33,329 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:33,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:33,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:33,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:36:33,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:33,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:33,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:33,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1177 [2022-12-06 07:36:33,481 INFO L420 AbstractCegarLoop]: === Iteration 1179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:33,481 INFO L85 PathProgramCache]: Analyzing trace with hash 267617602, now seen corresponding path program 1 times [2022-12-06 07:36:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:33,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981362843] [2022-12-06 07:36:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:33,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:36:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981362843] [2022-12-06 07:36:33,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981362843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:33,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:33,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171363663] [2022-12-06 07:36:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:33,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:33,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:33,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:33,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:33,805 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:33,806 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:33,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:33,819 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:33,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:33,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:33,820 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:33,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:33,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:33,855 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:33,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:33,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:33,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:33,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:33,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,881 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:33,881 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:33,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:33,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:33,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:34,017 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:36:34,017 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:34,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1178 [2022-12-06 07:36:34,017 INFO L420 AbstractCegarLoop]: === Iteration 1180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2010427937, now seen corresponding path program 1 times [2022-12-06 07:36:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799554628] [2022-12-06 07:36:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:34,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:36:34,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799554628] [2022-12-06 07:36:34,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799554628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129393315] [2022-12-06 07:36:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:34,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:34,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:34,354 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:34,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13584 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:34,366 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:34,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:34,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:34,367 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:34,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:34,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,401 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:34,401 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:34,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,401 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,425 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:34,426 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 07:36:34,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:34,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:34,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:34,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:36:34,578 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:34,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:34,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:34,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1179 [2022-12-06 07:36:34,578 INFO L420 AbstractCegarLoop]: === Iteration 1181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:34,578 INFO L85 PathProgramCache]: Analyzing trace with hash -541729024, now seen corresponding path program 1 times [2022-12-06 07:36:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:34,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187665703] [2022-12-06 07:36:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:34,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:34,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187665703] [2022-12-06 07:36:34,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187665703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:34,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:34,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423036256] [2022-12-06 07:36:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:34,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:34,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:34,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:34,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:34,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:34,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:34,905 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:34,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:34,920 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:34,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:34,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:34,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:34,920 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:34,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:34,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:34,961 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:34,962 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:34,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:34,962 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:34,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:34,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,987 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:34,987 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:36:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:34,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:34,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:35,137 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:36:35,138 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:35,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,138 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1180 [2022-12-06 07:36:35,138 INFO L420 AbstractCegarLoop]: === Iteration 1182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1201081311, now seen corresponding path program 1 times [2022-12-06 07:36:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766590687] [2022-12-06 07:36:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,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:36:35,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766590687] [2022-12-06 07:36:35,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766590687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876061988] [2022-12-06 07:36:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:35,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:35,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:35,461 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:35,461 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:35,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:35,474 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:35,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:35,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:35,475 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:35,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:35,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:35,508 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:35,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:35,508 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:35,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:35,508 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:35,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:35,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:35,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:35,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:35,534 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:35,534 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:35,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:35,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:35,537 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:35,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:35,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:36:35,676 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:35,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:35,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:35,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1181 [2022-12-06 07:36:35,677 INFO L420 AbstractCegarLoop]: === Iteration 1183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1351075650, now seen corresponding path program 1 times [2022-12-06 07:36:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:35,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674676473] [2022-12-06 07:36:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:35,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:36:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674676473] [2022-12-06 07:36:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674676473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:35,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024674008] [2022-12-06 07:36:35,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:35,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:35,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:35,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:35,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:35,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:35,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:35,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,022 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:36,022 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:36,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:36,035 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:36,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:36,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:36,036 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:36,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:36,070 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:36,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,070 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,094 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:36,094 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:36,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:36,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:36,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:36:36,243 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:36,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1182 [2022-12-06 07:36:36,243 INFO L420 AbstractCegarLoop]: === Iteration 1184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:36,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,243 INFO L85 PathProgramCache]: Analyzing trace with hash 391734685, now seen corresponding path program 1 times [2022-12-06 07:36:36,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289819158] [2022-12-06 07:36:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:36,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:36:36,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289819158] [2022-12-06 07:36:36,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289819158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676944712] [2022-12-06 07:36:36,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:36,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:36,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:36,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:36,600 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:36,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:36,617 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:36,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:36,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:36,618 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:36,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:36,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:36,653 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:36,653 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:36,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:36,653 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:36,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:36,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,678 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:36,678 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:36:36,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:36,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:36,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:36,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:36,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:36,824 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:36,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:36,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:36,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1183 [2022-12-06 07:36:36,825 INFO L420 AbstractCegarLoop]: === Iteration 1185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2134545020, now seen corresponding path program 1 times [2022-12-06 07:36:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:36,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212978586] [2022-12-06 07:36:36,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:36,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:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:36,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212978586] [2022-12-06 07:36:36,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212978586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:36,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:36,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930465092] [2022-12-06 07:36:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:36,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:36,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:36,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:36,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:36,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:36,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:36,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,200 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:37,201 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:37,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13502 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:37,211 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:37,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:37,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:37,212 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:37,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:37,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,240 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:37,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:37,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,265 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:37,265 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:36:37,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:37,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:37,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:36:37,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:37,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1184 [2022-12-06 07:36:37,412 INFO L420 AbstractCegarLoop]: === Iteration 1186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash -417611941, now seen corresponding path program 1 times [2022-12-06 07:36:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202705165] [2022-12-06 07:36:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:37,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:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:37,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202705165] [2022-12-06 07:36:37,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202705165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:37,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:37,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230179127] [2022-12-06 07:36:37,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:37,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:37,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:37,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:37,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:37,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:37,748 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:37,748 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:37,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13510 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:37,760 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:37,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:37,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:37,761 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:37,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:37,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:37,793 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:37,794 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:37,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:37,794 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:37,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:37,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,818 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:37,818 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:36:37,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:37,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:37,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:37,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:37,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:36:37,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:37,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:37,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:37,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1185 [2022-12-06 07:36:37,956 INFO L420 AbstractCegarLoop]: === Iteration 1187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1325198394, now seen corresponding path program 1 times [2022-12-06 07:36:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:37,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457393601] [2022-12-06 07:36:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457393601] [2022-12-06 07:36:38,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457393601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672019284] [2022-12-06 07:36:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:38,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:38,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,268 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:38,268 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:38,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:38,280 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:38,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:38,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:38,281 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:38,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:38,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:38,314 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:38,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,314 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:38,347 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:36:38,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:38,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:38,483 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:38,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:36:38,484 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:38,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:38,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:38,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1186 [2022-12-06 07:36:38,484 INFO L420 AbstractCegarLoop]: === Iteration 1188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1226958567, now seen corresponding path program 1 times [2022-12-06 07:36:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136036902] [2022-12-06 07:36:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:38,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:38,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:38,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136036902] [2022-12-06 07:36:38,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136036902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:38,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:38,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:38,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132155823] [2022-12-06 07:36:38,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:38,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:38,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:38,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:38,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:38,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:38,882 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:38,883 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13502 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:38,902 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:38,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:38,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:38,903 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:38,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:38,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:38,942 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:38,942 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:38,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:38,942 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:38,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:38,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,967 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:38,967 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:38,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:38,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:38,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:39,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:36:39,121 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:39,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1187 [2022-12-06 07:36:39,121 INFO L420 AbstractCegarLoop]: === Iteration 1189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 515851768, now seen corresponding path program 1 times [2022-12-06 07:36:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799901071] [2022-12-06 07:36:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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:36:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799901071] [2022-12-06 07:36:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799901071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720404974] [2022-12-06 07:36:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:39,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:39,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:39,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:39,483 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:39,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:39,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:39,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:39,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:39,497 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:39,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:39,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:39,534 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:39,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:39,534 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:39,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:39,534 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:39,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:39,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:39,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:39,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:39,559 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:39,559 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:36:39,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:39,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:39,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:39,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:39,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:36:39,704 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:39,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:39,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:39,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1188 [2022-12-06 07:36:39,705 INFO L420 AbstractCegarLoop]: === Iteration 1190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2036305193, now seen corresponding path program 1 times [2022-12-06 07:36:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230875505] [2022-12-06 07:36:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:39,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:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230875505] [2022-12-06 07:36:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230875505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:39,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:39,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450837792] [2022-12-06 07:36:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:39,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:39,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:39,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:39,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:39,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,035 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:40,036 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:40,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:40,049 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:40,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:40,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:40,050 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:40,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:40,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,083 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:40,083 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:40,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,083 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,108 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:40,108 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:36:40,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:40,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:40,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:40,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:40,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1189 [2022-12-06 07:36:40,254 INFO L420 AbstractCegarLoop]: === Iteration 1191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash -293494858, now seen corresponding path program 1 times [2022-12-06 07:36:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745320085] [2022-12-06 07:36:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745320085] [2022-12-06 07:36:40,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745320085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914744301] [2022-12-06 07:36:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:40,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:40,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:40,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:40,599 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:40,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:40,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:40,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:40,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:40,614 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:40,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:40,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:40,648 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:40,649 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:40,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:40,649 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:40,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:40,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,673 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:40,674 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:40,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:40,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:40,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:40,811 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:40,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:36:40,811 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:40,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:40,811 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:40,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190 [2022-12-06 07:36:40,811 INFO L420 AbstractCegarLoop]: === Iteration 1192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1449315477, now seen corresponding path program 1 times [2022-12-06 07:36:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439184868] [2022-12-06 07:36:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36: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:36:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439184868] [2022-12-06 07:36:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439184868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:40,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:40,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943482765] [2022-12-06 07:36:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:40,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:40,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:40,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:40,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:40,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:40,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,164 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:41,164 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:41,175 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:41,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:41,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:41,175 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:41,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,207 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:41,207 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:41,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,208 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,232 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:41,232 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:36:41,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:41,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:41,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:36:41,389 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:41,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1191 [2022-12-06 07:36:41,389 INFO L420 AbstractCegarLoop]: === Iteration 1193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1102841484, now seen corresponding path program 1 times [2022-12-06 07:36:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126014642] [2022-12-06 07:36:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,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:36:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126014642] [2022-12-06 07:36:41,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126014642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:41,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:41,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:41,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528916835] [2022-12-06 07:36:41,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:41,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:41,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:41,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:41,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:41,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:41,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:41,722 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:41,722 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:41,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:41,735 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:41,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:41,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:41,736 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:41,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:41,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:41,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:41,770 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:41,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:41,771 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:41,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:41,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,796 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:41,796 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:36:41,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:41,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:41,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:41,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:41,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:36:41,936 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:41,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:41,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:41,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1192 [2022-12-06 07:36:41,936 INFO L420 AbstractCegarLoop]: === Iteration 1194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash 639968851, now seen corresponding path program 1 times [2022-12-06 07:36:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924674390] [2022-12-06 07:36:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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:36:42,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924674390] [2022-12-06 07:36:42,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924674390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613818702] [2022-12-06 07:36:42,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:42,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:42,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,269 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:42,269 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:42,303 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:42,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:42,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:42,304 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:42,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:42,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,334 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:42,335 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:42,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,335 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,359 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:42,360 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:42,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:42,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:42,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:42,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:42,507 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:42,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:42,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:42,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1193 [2022-12-06 07:36:42,507 INFO L420 AbstractCegarLoop]: === Iteration 1195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1912188110, now seen corresponding path program 1 times [2022-12-06 07:36:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215694459] [2022-12-06 07:36:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:42,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:42,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:42,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215694459] [2022-12-06 07:36:42,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215694459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:42,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:42,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409755272] [2022-12-06 07:36:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:42,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:42,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:42,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:42,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:42,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:42,859 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:42,860 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:42,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:42,874 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:42,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:42,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:42,875 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:42,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:42,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:42,910 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:42,910 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:42,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:42,910 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:42,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:42,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,936 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:42,936 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:42,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:42,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:43,095 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:36:43,095 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:43,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1194 [2022-12-06 07:36:43,095 INFO L420 AbstractCegarLoop]: === Iteration 1196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -169377775, now seen corresponding path program 1 times [2022-12-06 07:36:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962214206] [2022-12-06 07:36:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,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:36:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962214206] [2022-12-06 07:36:43,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962214206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089589523] [2022-12-06 07:36:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:43,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:43,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:43,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:43,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:43,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:43,437 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:43,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:43,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:43,438 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:43,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:43,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:43,474 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:43,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:43,474 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:43,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:43,475 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:43,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:43,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:43,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:43,499 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:43,500 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:43,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:43,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:43,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:43,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 07:36:43,663 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:43,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:43,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:43,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195 [2022-12-06 07:36:43,663 INFO L420 AbstractCegarLoop]: === Iteration 1197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1573432560, now seen corresponding path program 1 times [2022-12-06 07:36:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302497388] [2022-12-06 07:36:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:43,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:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302497388] [2022-12-06 07:36:43,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302497388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:43,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:43,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:43,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960654566] [2022-12-06 07:36:43,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:43,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:43,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:43,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,018 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:44,018 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:44,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:44,031 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:44,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:44,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:44,032 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:44,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:44,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:44,070 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:44,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,070 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,094 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:44,095 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:36:44,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:44,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:44,236 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:36:44,236 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:44,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,236 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1196 [2022-12-06 07:36:44,236 INFO L420 AbstractCegarLoop]: === Iteration 1198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash -978724401, now seen corresponding path program 1 times [2022-12-06 07:36:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671066168] [2022-12-06 07:36:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:44,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:36:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671066168] [2022-12-06 07:36:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671066168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139543149] [2022-12-06 07:36:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:44,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:44,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:44,572 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:44,572 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:44,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:44,585 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:44,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:44,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:44,586 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:44,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:44,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:44,621 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:44,621 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:44,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:44,621 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:44,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:44,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,646 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:44,646 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:36:44,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:44,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:44,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:44,792 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:44,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:44,793 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:44,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:44,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:44,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1197 [2022-12-06 07:36:44,793 INFO L420 AbstractCegarLoop]: === Iteration 1199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:44,793 INFO L85 PathProgramCache]: Analyzing trace with hash 764085934, now seen corresponding path program 1 times [2022-12-06 07:36:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:44,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11543625] [2022-12-06 07:36:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:44,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:44,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11543625] [2022-12-06 07:36:44,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11543625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:44,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:44,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833847093] [2022-12-06 07:36:44,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:44,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:44,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:44,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:44,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:44,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:45,134 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:45,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:45,146 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:45,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:45,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:45,147 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:45,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:45,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,180 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:45,180 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:45,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,180 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,205 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:45,205 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:36:45,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:45,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:45,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:36:45,357 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:45,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1198 [2022-12-06 07:36:45,357 INFO L420 AbstractCegarLoop]: === Iteration 1200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1788071027, now seen corresponding path program 1 times [2022-12-06 07:36:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586756210] [2022-12-06 07:36:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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:36:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586756210] [2022-12-06 07:36:45,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586756210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286268554] [2022-12-06 07:36:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:45,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:45,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:45,697 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:45,697 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:36:45,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:45,710 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:45,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:45,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:45,711 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:45,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:45,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:45,745 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:45,745 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:45,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:45,745 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:45,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:45,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,770 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:45,770 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:45,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:45,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:45,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:45,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:45,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:36:45,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:45,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:45,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:45,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1199 [2022-12-06 07:36:45,913 INFO L420 AbstractCegarLoop]: === Iteration 1201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -45260692, now seen corresponding path program 1 times [2022-12-06 07:36:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:45,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326611913] [2022-12-06 07:36:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:45,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:36:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:45,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326611913] [2022-12-06 07:36:45,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326611913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:45,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:45,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778655735] [2022-12-06 07:36:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:45,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:45,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:45,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:45,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:45,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:45,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:45,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:46,262 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:46,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:46,272 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:46,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:46,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:46,273 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:46,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:46,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,303 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:46,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:46,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,304 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,328 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:46,329 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:36:46,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:46,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:46,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:46,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:36:46,471 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:46,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:46,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:46,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1200 [2022-12-06 07:36:46,471 INFO L420 AbstractCegarLoop]: === Iteration 1202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1697549643, now seen corresponding path program 1 times [2022-12-06 07:36:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:46,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525072337] [2022-12-06 07:36:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:46,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:36:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:46,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525072337] [2022-12-06 07:36:46,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525072337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:46,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:46,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434095149] [2022-12-06 07:36:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:46,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:46,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:46,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:46,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:46,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:46,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:46,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:46,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:46,809 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:46,809 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:46,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:46,822 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:46,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:46,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:46,822 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:46,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:46,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:46,856 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:46,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:46,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:46,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:46,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:46,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,881 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:46,881 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:46,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:46,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:46,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:47,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:36:47,020 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:47,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1201 [2022-12-06 07:36:47,020 INFO L420 AbstractCegarLoop]: === Iteration 1203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash -854607318, now seen corresponding path program 1 times [2022-12-06 07:36:47,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122431380] [2022-12-06 07:36:47,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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:36:47,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122431380] [2022-12-06 07:36:47,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122431380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:47,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664705933] [2022-12-06 07:36:47,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:47,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:47,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,376 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:47,377 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:47,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:47,390 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:47,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:47,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:47,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:47,391 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:47,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:47,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,448 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:47,448 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:47,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,448 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,449 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,474 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:47,474 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:47,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:47,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:47,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:47,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:47,620 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:47,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,620 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:47,620 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:47,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1202 [2022-12-06 07:36:47,620 INFO L420 AbstractCegarLoop]: === Iteration 1204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 888203017, now seen corresponding path program 1 times [2022-12-06 07:36:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649643250] [2022-12-06 07:36:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:47,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:36:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:47,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649643250] [2022-12-06 07:36:47,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649643250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:47,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:47,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428778069] [2022-12-06 07:36:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:47,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:47,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:47,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:47,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:47,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:47,945 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:47,946 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:47,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:47,959 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:47,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:47,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:47,960 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:47,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:47,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:47,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:47,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:47,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:47,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:47,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:47,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:47,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,020 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:48,020 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:48,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:48,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:48,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:36:48,177 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:48,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203 [2022-12-06 07:36:48,178 INFO L420 AbstractCegarLoop]: === Iteration 1205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1663953944, now seen corresponding path program 1 times [2022-12-06 07:36:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302837800] [2022-12-06 07:36:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302837800] [2022-12-06 07:36:48,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302837800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107524802] [2022-12-06 07:36:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:48,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:48,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:48,527 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:48,527 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:48,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:48,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:48,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:48,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:48,540 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:48,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:48,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:48,575 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:48,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:48,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:48,575 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:48,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:48,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,600 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:48,600 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:36:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:48,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:48,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:48,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:48,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:36:48,733 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:48,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:48,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:48,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204 [2022-12-06 07:36:48,733 INFO L420 AbstractCegarLoop]: === Iteration 1206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash 78856391, now seen corresponding path program 1 times [2022-12-06 07:36:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:48,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696851277] [2022-12-06 07:36:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:48,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:36:48,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696851277] [2022-12-06 07:36:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696851277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:48,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:48,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212152034] [2022-12-06 07:36:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:48,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:48,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:48,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:48,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:48,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,064 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:49,064 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:49,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:49,077 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:49,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:49,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:49,078 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:49,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:49,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,112 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:49,112 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:49,112 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,113 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,137 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:49,137 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 07:36:49,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:49,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:49,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:36:49,287 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:49,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1205 [2022-12-06 07:36:49,287 INFO L420 AbstractCegarLoop]: === Iteration 1207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:49,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1821666726, now seen corresponding path program 1 times [2022-12-06 07:36:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707621697] [2022-12-06 07:36:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707621697] [2022-12-06 07:36:49,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707621697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173676877] [2022-12-06 07:36:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:49,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:49,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:49,631 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:49,631 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:49,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:49,644 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:49,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:49,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:49,645 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:49,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:49,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:49,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:49,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:49,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:49,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:49,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,706 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:49,706 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:36:49,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:49,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:49,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:49,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:49,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:49,850 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:49,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:49,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:49,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1206 [2022-12-06 07:36:49,851 INFO L420 AbstractCegarLoop]: === Iteration 1208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:49,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash -730490235, now seen corresponding path program 1 times [2022-12-06 07:36:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:49,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952188577] [2022-12-06 07:36:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:49,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:36:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:49,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952188577] [2022-12-06 07:36:49,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952188577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:49,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:49,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679424301] [2022-12-06 07:36:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:49,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:49,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:49,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:49,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:49,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:49,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:49,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:49,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:50,197 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:50,197 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:50,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:50,209 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:50,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:50,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:50,210 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:50,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:50,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:50,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:50,242 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:50,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,267 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:50,268 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:36:50,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:50,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:50,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:36:50,417 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:50,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1207 [2022-12-06 07:36:50,418 INFO L420 AbstractCegarLoop]: === Iteration 1209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1012320100, now seen corresponding path program 1 times [2022-12-06 07:36:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313500124] [2022-12-06 07:36:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:50,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:50,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313500124] [2022-12-06 07:36:50,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313500124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:50,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:50,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442381581] [2022-12-06 07:36:50,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:50,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:50,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:50,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:50,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:50,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:50,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:50,757 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13493 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:50,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:50,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:50,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:50,769 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:50,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:50,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:50,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:50,805 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:50,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:50,805 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:50,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:50,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,830 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:50,830 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 07:36:50,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:50,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:50,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:50,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:50,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:36:50,981 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:50,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:50,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:50,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208 [2022-12-06 07:36:50,982 INFO L420 AbstractCegarLoop]: === Iteration 1210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1539836861, now seen corresponding path program 1 times [2022-12-06 07:36:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188093913] [2022-12-06 07:36:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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:36:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188093913] [2022-12-06 07:36:51,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188093913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136318893] [2022-12-06 07:36:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:51,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:51,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:51,318 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:51,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:51,328 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:51,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:51,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:51,329 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:51,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:51,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,360 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:51,360 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:51,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,360 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,384 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:51,385 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:36:51,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:51,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:51,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:51,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:51,532 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:51,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:51,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:51,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1209 [2022-12-06 07:36:51,532 INFO L420 AbstractCegarLoop]: === Iteration 1211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 202973474, now seen corresponding path program 1 times [2022-12-06 07:36:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898135936] [2022-12-06 07:36:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:51,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:36:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898135936] [2022-12-06 07:36:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898135936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:51,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:51,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339649372] [2022-12-06 07:36:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:51,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:51,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:51,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:51,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:51,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:51,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:51,874 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:51,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:51,887 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:51,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:51,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:51,888 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:51,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:51,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:51,924 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:51,924 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:51,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:51,924 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:51,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:51,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,949 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:51,949 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:36:51,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:51,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:51,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:52,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:36:52,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:52,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1210 [2022-12-06 07:36:52,086 INFO L420 AbstractCegarLoop]: === Iteration 1212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1945783809, now seen corresponding path program 1 times [2022-12-06 07:36:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501721724] [2022-12-06 07:36:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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:36:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501721724] [2022-12-06 07:36:52,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501721724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687678695] [2022-12-06 07:36:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:52,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:52,427 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:52,427 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:52,440 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:52,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:52,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:52,440 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:52,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:52,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:52,473 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:52,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:52,473 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:52,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:52,473 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:52,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:52,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:52,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:52,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:52,505 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:52,506 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:36:52,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:52,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:52,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:52,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:52,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:36:52,656 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:52,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:52,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:52,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1211 [2022-12-06 07:36:52,657 INFO L420 AbstractCegarLoop]: === Iteration 1213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash -606373152, now seen corresponding path program 1 times [2022-12-06 07:36:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:52,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911544053] [2022-12-06 07:36:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:52,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:36:52,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:52,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911544053] [2022-12-06 07:36:52,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911544053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:52,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:52,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870655205] [2022-12-06 07:36:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:52,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:52,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:52,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:52,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:52,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,012 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:53,012 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:53,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:53,025 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:53,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:53,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:53,026 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:53,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:53,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,063 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:53,063 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:53,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,063 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,089 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:53,089 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:36:53,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:53,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:53,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:53,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:53,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1212 [2022-12-06 07:36:53,235 INFO L420 AbstractCegarLoop]: === Iteration 1214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:53,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1136437183, now seen corresponding path program 1 times [2022-12-06 07:36:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747254131] [2022-12-06 07:36:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:53,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:36:53,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747254131] [2022-12-06 07:36:53,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747254131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106047903] [2022-12-06 07:36:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:53,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:53,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:53,577 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:53,577 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:53,589 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:53,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:53,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:53,590 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:53,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:53,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:53,624 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:53,624 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:53,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:53,624 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:53,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:53,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,648 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:53,648 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:53,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:53,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:53,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:53,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:53,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:36:53,783 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:53,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:53,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:53,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213 [2022-12-06 07:36:53,783 INFO L420 AbstractCegarLoop]: === Iteration 1215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1415719778, now seen corresponding path program 1 times [2022-12-06 07:36:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:53,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566117883] [2022-12-06 07:36:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:53,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:36:53,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:53,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566117883] [2022-12-06 07:36:53,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566117883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:53,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:53,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584130632] [2022-12-06 07:36:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:53,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:53,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:53,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:53,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:53,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:53,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,136 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:54,136 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:36:54,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13538 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:54,149 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:54,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:54,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:54,150 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:54,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:54,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,187 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:54,188 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:54,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,188 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,213 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:54,213 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:54,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:54,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:54,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:36:54,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1214 [2022-12-06 07:36:54,367 INFO L420 AbstractCegarLoop]: === Iteration 1216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash 327090557, now seen corresponding path program 1 times [2022-12-06 07:36:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844800700] [2022-12-06 07:36:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:54,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:36:54,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844800700] [2022-12-06 07:36:54,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844800700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747814930] [2022-12-06 07:36:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:54,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:54,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:54,694 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:54,694 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:54,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:54,708 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:54,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:54,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:54,709 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:54,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:54,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:54,742 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:54,742 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:54,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:54,742 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:54,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:54,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,768 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:54,768 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:36:54,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:54,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:54,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:54,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:54,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:36:54,922 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:54,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:54,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:54,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1215 [2022-12-06 07:36:54,922 INFO L420 AbstractCegarLoop]: === Iteration 1217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2069900892, now seen corresponding path program 1 times [2022-12-06 07:36:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969802313] [2022-12-06 07:36:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:54,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:54,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:36:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:54,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969802313] [2022-12-06 07:36:54,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969802313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:54,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:54,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754459417] [2022-12-06 07:36:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:54,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:54,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:54,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:54,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:54,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,257 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:55,257 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:55,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:55,269 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:55,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:55,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:55,269 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:55,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:55,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,300 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:55,300 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:55,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,300 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,325 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:55,326 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:36:55,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:55,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:55,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:55,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:36:55,469 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:55,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:55,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:55,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1216 [2022-12-06 07:36:55,469 INFO L420 AbstractCegarLoop]: === Iteration 1218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash -482256069, now seen corresponding path program 1 times [2022-12-06 07:36:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:55,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491671300] [2022-12-06 07:36:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:55,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:55,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:36:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:55,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491671300] [2022-12-06 07:36:55,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491671300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:55,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:55,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753146515] [2022-12-06 07:36:55,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:55,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:55,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:55,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:55,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:55,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:55,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:55,816 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:55,816 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:36:55,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13548 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:55,829 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:55,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:55,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:55,830 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:55,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:55,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:55,864 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:55,864 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:55,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:55,864 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:55,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:55,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,889 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:36:55,889 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:36:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:36:55,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:55,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:56,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:36:56,043 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:56,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,044 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217 [2022-12-06 07:36:56,044 INFO L420 AbstractCegarLoop]: === Iteration 1219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1260554266, now seen corresponding path program 1 times [2022-12-06 07:36:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360027606] [2022-12-06 07:36:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:56,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:36:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360027606] [2022-12-06 07:36:56,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360027606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453917449] [2022-12-06 07:36:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:56,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:56,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,394 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:56,394 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:56,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:56,405 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:56,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:56,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:56,406 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:56,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:56,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,437 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:56,437 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:56,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,437 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,461 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:56,462 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:36:56,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:56,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:56,599 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:56,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:36:56,599 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:56,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:56,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:56,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1218 [2022-12-06 07:36:56,600 INFO L420 AbstractCegarLoop]: === Iteration 1220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1291602695, now seen corresponding path program 1 times [2022-12-06 07:36:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:56,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152878530] [2022-12-06 07:36:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:56,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:56,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:56,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152878530] [2022-12-06 07:36:56,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152878530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:56,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:56,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191366153] [2022-12-06 07:36:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:56,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:56,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:56,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:56,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:56,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:56,934 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:56,935 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:36:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13527 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:56,947 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:56,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:56,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:56,948 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:56,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:56,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:56,983 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:56,983 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:56,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:56,983 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:56,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:56,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:56,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,013 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:57,013 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:36:57,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:57,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:57,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:36:57,154 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:57,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1219 [2022-12-06 07:36:57,154 INFO L420 AbstractCegarLoop]: === Iteration 1221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 451207640, now seen corresponding path program 1 times [2022-12-06 07:36:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49386349] [2022-12-06 07:36:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,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:36:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49386349] [2022-12-06 07:36:57,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49386349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:57,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821039772] [2022-12-06 07:36:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:57,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:57,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:57,491 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:57,491 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:57,504 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:57,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:57,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:57,505 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:57,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:57,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:57,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:57,540 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:57,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:57,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:57,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:57,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,565 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:57,565 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:36:57,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:57,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:57,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:57,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:57,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:36:57,712 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:57,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:57,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1220 [2022-12-06 07:36:57,713 INFO L420 AbstractCegarLoop]: === Iteration 1222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2100949321, now seen corresponding path program 1 times [2022-12-06 07:36:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:57,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298059610] [2022-12-06 07:36:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:57,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:36:57,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:57,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298059610] [2022-12-06 07:36:57,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298059610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:57,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:57,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:57,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860648441] [2022-12-06 07:36:57,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:57,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:57,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:57,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:57,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:57,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (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,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:57,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:58,042 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:58,043 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:36:58,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:58,058 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:58,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:58,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:58,059 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:58,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:58,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:58,098 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:58,098 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:58,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:58,098 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:58,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:58,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,124 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:58,124 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:36:58,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:58,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:58,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:58,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:36:58,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:58,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:58,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:58,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:58,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1221 [2022-12-06 07:36:58,273 INFO L420 AbstractCegarLoop]: === Iteration 1223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -358138986, now seen corresponding path program 1 times [2022-12-06 07:36:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:58,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852685888] [2022-12-06 07:36:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:58,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:36:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:58,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852685888] [2022-12-06 07:36:58,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852685888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:58,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:58,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925337878] [2022-12-06 07:36:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:58,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:58,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:58,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:58,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:58,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:58,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:58,633 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:58,633 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:58,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:58,647 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:58,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:58,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:58,647 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:58,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:58,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:58,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:58,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:58,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:58,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:58,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:58,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,706 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:58,706 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:36:58,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:58,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:58,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:58,842 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:58,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:36:58,843 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:58,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:58,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:58,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:58,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1222 [2022-12-06 07:36:58,843 INFO L420 AbstractCegarLoop]: === Iteration 1224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:58,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1384671349, now seen corresponding path program 1 times [2022-12-06 07:36:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:58,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922872141] [2022-12-06 07:36:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:58,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:36:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922872141] [2022-12-06 07:36:58,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922872141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:58,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:58,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118360774] [2022-12-06 07:36:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:58,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:58,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:58,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:58,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:58,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:59,173 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:59,173 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:36:59,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:59,185 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:59,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:59,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:59,186 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:59,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:59,222 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,222 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:59,222 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:59,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:59,222 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:59,223 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:59,223 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,247 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:59,247 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:36:59,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:59,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:59,389 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:59,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:36:59,390 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:59,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:59,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:59,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:59,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1223 [2022-12-06 07:36:59,390 INFO L420 AbstractCegarLoop]: === Iteration 1225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1167485612, now seen corresponding path program 1 times [2022-12-06 07:36:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:59,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11014721] [2022-12-06 07:36:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:59,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:59,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:36:59,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:59,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11014721] [2022-12-06 07:36:59,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11014721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:59,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:59,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173171150] [2022-12-06 07:36:59,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:59,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:59,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:59,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:59,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:59,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:59,708 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:36:59,708 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:36:59,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:36:59,720 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:36:59,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:36:59,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:36:59,721 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:36:59,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:36:59,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:59,754 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:36:59,754 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:36:59,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:59,754 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:59,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:59,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,779 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:36:59,779 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:36:59,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:36:59,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:36:59,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:36:59,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:59,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:36:59,921 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:36:59,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:59,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:59,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:59,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1224 [2022-12-06 07:36:59,922 INFO L420 AbstractCegarLoop]: === Iteration 1226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:36:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:59,922 INFO L85 PathProgramCache]: Analyzing trace with hash 575324723, now seen corresponding path program 1 times [2022-12-06 07:36:59,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:59,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200920871] [2022-12-06 07:36:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:59,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:36:59,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:59,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200920871] [2022-12-06 07:36:59,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200920871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:59,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:59,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:36:59,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311835753] [2022-12-06 07:36:59,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:59,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:59,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:59,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:59,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:36:59,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:59,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:59,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:36:59,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:00,289 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:00,290 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:00,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:00,302 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:00,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:00,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:00,302 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:00,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:00,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:00,334 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:00,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:00,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:00,334 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:00,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:00,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,367 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:00,368 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:37:00,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:00,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:00,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:00,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:37:00,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:00,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:00,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:00,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:00,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1225 [2022-12-06 07:37:00,509 INFO L420 AbstractCegarLoop]: === Iteration 1227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1976832238, now seen corresponding path program 1 times [2022-12-06 07:37:00,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026320894] [2022-12-06 07:37:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:00,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:37:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:00,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026320894] [2022-12-06 07:37:00,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026320894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:00,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:00,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362309139] [2022-12-06 07:37:00,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:00,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:00,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:00,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:00,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:00,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:00,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:00,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:00,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:00,832 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:00,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:00,845 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:00,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:00,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:00,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:00,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:00,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:00,880 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:00,880 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:00,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:00,880 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:00,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:00,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,905 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:00,905 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:00,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2962 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:00,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:00,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:01,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:01,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:37:01,043 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:01,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:01,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:01,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:01,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1226 [2022-12-06 07:37:01,043 INFO L420 AbstractCegarLoop]: === Iteration 1228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -234021903, now seen corresponding path program 1 times [2022-12-06 07:37:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:01,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847150666] [2022-12-06 07:37:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:01,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:37:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:01,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847150666] [2022-12-06 07:37:01,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847150666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:01,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:01,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613919234] [2022-12-06 07:37:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:01,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:01,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:01,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:01,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:01,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:01,388 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:01,388 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:01,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:01,402 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:01,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:01,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:01,403 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:01,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:01,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:01,458 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:01,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:01,459 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:01,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:01,459 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:01,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:01,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:01,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:01,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:01,484 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:01,484 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:01,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:01,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:01,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:01,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:01,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:37:01,636 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:01,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:01,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:01,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:01,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1227 [2022-12-06 07:37:01,637 INFO L420 AbstractCegarLoop]: === Iteration 1229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1508788432, now seen corresponding path program 1 times [2022-12-06 07:37:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:01,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057232917] [2022-12-06 07:37:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:01,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057232917] [2022-12-06 07:37:01,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057232917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:01,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:01,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481623459] [2022-12-06 07:37:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:01,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:01,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:01,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:01,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:01,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:01,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:01,963 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:01,964 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:01,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:01,976 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:01,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:01,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:01,977 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:01,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:02,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:02,011 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:02,011 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:02,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:02,011 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,012 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:02,012 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:02,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,036 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:02,036 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:37:02,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:02,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:02,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:02,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:37:02,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:02,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:02,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:02,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:02,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1228 [2022-12-06 07:37:02,175 INFO L420 AbstractCegarLoop]: === Iteration 1230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1043368529, now seen corresponding path program 1 times [2022-12-06 07:37:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:02,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907906777] [2022-12-06 07:37:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:02,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:37:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907906777] [2022-12-06 07:37:02,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907906777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:02,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:02,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765684988] [2022-12-06 07:37:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:02,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:02,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:02,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:02,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:02,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:02,499 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:02,499 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:02,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:02,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:02,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:02,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:02,513 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:02,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:02,548 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:02,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:02,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:02,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:02,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:02,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,573 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:02,573 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:37:02,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:02,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:02,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:02,724 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:02,724 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:37:02,724 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:02,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:02,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:02,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1229 [2022-12-06 07:37:02,725 INFO L420 AbstractCegarLoop]: === Iteration 1231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash 699441806, now seen corresponding path program 1 times [2022-12-06 07:37:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052620902] [2022-12-06 07:37:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:02,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:37:02,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:02,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052620902] [2022-12-06 07:37:02,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052620902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:02,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:02,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779331738] [2022-12-06 07:37:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:02,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:02,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:02,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:02,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:02,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:02,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:03,104 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:03,104 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:03,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:03,117 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:03,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:03,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:03,117 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:03,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:03,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:03,153 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:03,153 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:03,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:03,153 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:03,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:03,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,178 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:03,179 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:03,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:03,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:03,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:03,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:37:03,335 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:03,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:03,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:03,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:03,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1230 [2022-12-06 07:37:03,335 INFO L420 AbstractCegarLoop]: === Iteration 1232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1852715155, now seen corresponding path program 1 times [2022-12-06 07:37:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:03,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96736013] [2022-12-06 07:37:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:03,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:37:03,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:03,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96736013] [2022-12-06 07:37:03,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96736013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:03,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:03,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:03,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087472035] [2022-12-06 07:37:03,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:03,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:03,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:03,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:03,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:03,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:03,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:03,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:03,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:03,663 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:03,663 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:03,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:03,676 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:03,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:03,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:03,677 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:03,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:03,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:03,710 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:03,710 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:03,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:03,710 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:03,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:03,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,735 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:03,736 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:03,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:03,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:03,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:03,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:03,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 07:37:03,866 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:03,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:03,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:03,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:03,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1231 [2022-12-06 07:37:03,866 INFO L420 AbstractCegarLoop]: === Iteration 1233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -109904820, now seen corresponding path program 1 times [2022-12-06 07:37:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122739936] [2022-12-06 07:37:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:03,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:37:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:03,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122739936] [2022-12-06 07:37:03,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122739936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:03,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:03,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304632583] [2022-12-06 07:37:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:03,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:03,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:03,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:03,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:03,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:03,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:04,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:04,196 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:04,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:04,208 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:04,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:04,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:04,209 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:04,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:04,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:04,243 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:04,243 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:04,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:04,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:04,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:04,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,268 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:04,268 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:37:04,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:04,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:04,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:04,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:37:04,410 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:04,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:04,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:04,410 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:04,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1232 [2022-12-06 07:37:04,410 INFO L420 AbstractCegarLoop]: === Iteration 1234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1632905515, now seen corresponding path program 1 times [2022-12-06 07:37:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219216986] [2022-12-06 07:37:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:04,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:37:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:04,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219216986] [2022-12-06 07:37:04,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219216986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:04,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:04,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704834215] [2022-12-06 07:37:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:04,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:04,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:04,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:04,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:04,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:04,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:04,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:04,742 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:04,742 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:37:04,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:04,755 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:04,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:04,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:04,756 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:04,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:04,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:04,790 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:04,790 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:04,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:04,790 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:04,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:04,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,815 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:04,815 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:37:04,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:04,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:04,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:04,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:04,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:37:04,951 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:04,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:04,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:04,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:04,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1233 [2022-12-06 07:37:04,951 INFO L420 AbstractCegarLoop]: === Iteration 1235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash -919251446, now seen corresponding path program 1 times [2022-12-06 07:37:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:04,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088248934] [2022-12-06 07:37:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:05,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088248934] [2022-12-06 07:37:05,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088248934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:05,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:05,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155123556] [2022-12-06 07:37:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:05,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:05,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:05,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:05,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:05,296 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:05,296 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:05,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:05,306 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:05,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:05,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:05,307 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:05,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:05,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:05,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:05,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:05,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:05,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:05,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:05,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,363 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:05,363 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:05,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:05,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:05,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:05,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:05,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:05,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:05,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:05,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:05,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1234 [2022-12-06 07:37:05,511 INFO L420 AbstractCegarLoop]: === Iteration 1236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash 823558889, now seen corresponding path program 1 times [2022-12-06 07:37:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:05,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051418817] [2022-12-06 07:37:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:05,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051418817] [2022-12-06 07:37:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051418817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:05,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303114305] [2022-12-06 07:37:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:05,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:05,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:05,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:05,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:05,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:05,834 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:05,835 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:05,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:05,848 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:05,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:05,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:05,848 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:05,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:05,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:05,882 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,882 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:05,883 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:05,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:05,883 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:05,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:05,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,908 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:05,908 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:05,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:05,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:05,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:06,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:06,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:37:06,048 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:06,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:06,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:06,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:06,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1235 [2022-12-06 07:37:06,048 INFO L420 AbstractCegarLoop]: === Iteration 1237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1728598072, now seen corresponding path program 1 times [2022-12-06 07:37:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:06,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581658195] [2022-12-06 07:37:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:06,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:37:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:06,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581658195] [2022-12-06 07:37:06,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581658195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:06,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:06,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945539233] [2022-12-06 07:37:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:06,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:06,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:06,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:06,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:06,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:06,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:06,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:06,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:06,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:06,384 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:06,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:06,397 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:06,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:06,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:06,398 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:06,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:06,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:06,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:06,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:06,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:06,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:06,438 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:06,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:06,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:06,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:06,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:06,464 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:06,464 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 07:37:06,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:06,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:06,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:06,616 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:06,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:37:06,617 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:06,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:06,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:06,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:06,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1236 [2022-12-06 07:37:06,617 INFO L420 AbstractCegarLoop]: === Iteration 1238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash 14212263, now seen corresponding path program 1 times [2022-12-06 07:37:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002640218] [2022-12-06 07:37:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:06,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:37:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:06,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002640218] [2022-12-06 07:37:06,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002640218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:06,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:06,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968566060] [2022-12-06 07:37:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:06,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:06,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:06,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:06,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:06,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:06,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:06,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:06,976 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:06,976 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:06,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:06,990 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:06,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:06,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:06,990 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:06,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:07,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:07,029 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:07,029 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:07,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:07,029 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:07,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:07,030 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,055 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:07,055 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:37:07,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:07,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:07,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:07,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:37:07,196 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:07,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:07,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:07,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:07,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237 [2022-12-06 07:37:07,196 INFO L420 AbstractCegarLoop]: === Iteration 1239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1757022598, now seen corresponding path program 1 times [2022-12-06 07:37:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:07,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200942363] [2022-12-06 07:37:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:07,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:37:07,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200942363] [2022-12-06 07:37:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200942363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:07,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451206905] [2022-12-06 07:37:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:07,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:07,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:07,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:07,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:07,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:07,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:07,535 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:07,535 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:07,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:07,548 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:07,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:07,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:07,548 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:07,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:07,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:07,582 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:07,582 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:07,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:07,582 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:07,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:07,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,607 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:07,607 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:37:07,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:07,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:07,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:07,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:07,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:07,765 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:07,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:07,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:07,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:07,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1238 [2022-12-06 07:37:07,765 INFO L420 AbstractCegarLoop]: === Iteration 1240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash -795134363, now seen corresponding path program 1 times [2022-12-06 07:37:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:07,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023670865] [2022-12-06 07:37:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:07,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:37:07,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:07,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023670865] [2022-12-06 07:37:07,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023670865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:07,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:07,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:07,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766259804] [2022-12-06 07:37:07,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:07,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:07,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:07,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:07,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:07,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:08,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:08,129 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:08,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:08,141 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:08,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:08,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:08,142 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:08,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:08,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:08,176 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:08,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:08,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:08,176 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:08,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:08,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,201 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:08,201 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:08,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:08,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:08,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:08,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:37:08,365 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:08,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:08,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:08,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:08,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1239 [2022-12-06 07:37:08,365 INFO L420 AbstractCegarLoop]: === Iteration 1241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash 947675972, now seen corresponding path program 1 times [2022-12-06 07:37:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740447929] [2022-12-06 07:37:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:08,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:37:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:08,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740447929] [2022-12-06 07:37:08,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740447929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:08,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:08,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022912965] [2022-12-06 07:37:08,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:08,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:08,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:08,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:08,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:08,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:08,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:08,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:08,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:08,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:08,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:08,695 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:37:08,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:08,708 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:08,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:08,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:08,709 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:08,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:08,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:08,744 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:08,744 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:08,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:08,744 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:08,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:08,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,769 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:08,769 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:37:08,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:08,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:08,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:08,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:08,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:37:08,919 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:08,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:08,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:08,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:08,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1240 [2022-12-06 07:37:08,920 INFO L420 AbstractCegarLoop]: === Iteration 1242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1604480989, now seen corresponding path program 1 times [2022-12-06 07:37:08,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:08,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732137196] [2022-12-06 07:37:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:08,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:37:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:08,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732137196] [2022-12-06 07:37:08,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732137196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:08,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:08,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073834364] [2022-12-06 07:37:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:08,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:08,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:08,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:08,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:08,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:08,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:09,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:09,279 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:09,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:09,291 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:09,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:09,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:09,292 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:09,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:09,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:09,326 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:09,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:09,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:09,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:09,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:09,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,358 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:09,358 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:09,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:09,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:09,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:09,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:37:09,508 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:09,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:09,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:09,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:09,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1241 [2022-12-06 07:37:09,508 INFO L420 AbstractCegarLoop]: === Iteration 1243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash 138329346, now seen corresponding path program 1 times [2022-12-06 07:37:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:09,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845928754] [2022-12-06 07:37:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:09,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:37:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:09,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845928754] [2022-12-06 07:37:09,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845928754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:09,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:09,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573724835] [2022-12-06 07:37:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:09,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:09,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:09,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:09,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:09,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:09,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:09,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:09,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:09,840 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:09,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:09,852 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:09,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:09,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:09,852 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:09,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:09,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:09,885 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:09,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:09,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:09,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:09,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:09,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,910 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:09,910 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 07:37:09,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:09,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:09,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:10,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:10,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:37:10,050 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:10,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:10,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:10,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1242 [2022-12-06 07:37:10,051 INFO L420 AbstractCegarLoop]: === Iteration 1244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1881139681, now seen corresponding path program 1 times [2022-12-06 07:37:10,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142987086] [2022-12-06 07:37:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:10,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:10,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:37:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142987086] [2022-12-06 07:37:10,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142987086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:10,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:10,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38429971] [2022-12-06 07:37:10,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:10,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:10,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:10,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:10,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:10,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:10,368 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:10,368 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:10,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:10,380 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:10,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:10,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:10,381 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:10,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:10,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:10,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:10,434 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:10,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:10,434 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:10,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:10,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,458 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:10,458 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:10,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:10,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:10,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:10,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:37:10,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:10,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1243 [2022-12-06 07:37:10,601 INFO L420 AbstractCegarLoop]: === Iteration 1245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -671017280, now seen corresponding path program 1 times [2022-12-06 07:37:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:10,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973005436] [2022-12-06 07:37:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973005436] [2022-12-06 07:37:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973005436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750872009] [2022-12-06 07:37:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:10,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:10,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:10,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:10,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:10,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:10,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:10,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:10,946 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:10,959 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:10,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:10,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:10,960 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:10,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:10,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:10,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:10,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:10,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:10,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:10,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:10,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,020 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:11,020 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:37:11,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:11,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:11,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:11,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:37:11,166 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:11,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:11,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:11,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:11,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1244 [2022-12-06 07:37:11,167 INFO L420 AbstractCegarLoop]: === Iteration 1246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1071793055, now seen corresponding path program 1 times [2022-12-06 07:37:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:11,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627083130] [2022-12-06 07:37:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:11,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:37:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627083130] [2022-12-06 07:37:11,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627083130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:11,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:11,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240064180] [2022-12-06 07:37:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:11,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:11,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:11,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:11,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:11,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:11,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:11,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:11,498 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:11,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:11,511 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:11,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:11,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:11,512 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:11,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:11,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:11,547 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:11,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:11,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:11,547 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:11,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:11,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,572 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:11,572 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:37:11,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:11,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:11,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:11,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:11,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:37:11,718 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:11,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:11,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:11,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:11,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1245 [2022-12-06 07:37:11,718 INFO L420 AbstractCegarLoop]: === Iteration 1247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1480363906, now seen corresponding path program 1 times [2022-12-06 07:37:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:11,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150005379] [2022-12-06 07:37:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:11,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:37:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:11,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150005379] [2022-12-06 07:37:11,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150005379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:11,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:11,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434918874] [2022-12-06 07:37:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:11,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:11,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:11,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:11,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:11,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:12,078 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:12,079 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:12,093 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:12,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:12,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:12,094 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:12,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:12,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:12,134 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:12,134 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:12,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:12,134 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:12,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:12,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,160 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:12,160 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:37:12,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:12,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:12,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:12,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:37:12,314 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:12,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:12,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:12,314 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1246 [2022-12-06 07:37:12,314 INFO L420 AbstractCegarLoop]: === Iteration 1248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 262446429, now seen corresponding path program 1 times [2022-12-06 07:37:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682585206] [2022-12-06 07:37:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:12,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:37:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:12,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682585206] [2022-12-06 07:37:12,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682585206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:12,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:12,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149387468] [2022-12-06 07:37:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:12,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:12,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:12,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:12,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:12,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:12,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:12,670 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:12,671 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:12,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:12,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:12,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:12,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:12,685 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:12,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:12,721 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:12,721 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:12,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:12,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:12,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:12,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,746 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:12,746 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:12,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:12,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:12,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:12,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:12,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:37:12,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:12,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:12,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:12,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:12,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1247 [2022-12-06 07:37:12,901 INFO L420 AbstractCegarLoop]: === Iteration 1249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2005256764, now seen corresponding path program 1 times [2022-12-06 07:37:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:12,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973295485] [2022-12-06 07:37:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:12,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:37:12,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:12,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973295485] [2022-12-06 07:37:12,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973295485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:12,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:12,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190068440] [2022-12-06 07:37:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:12,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:12,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:12,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:12,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:12,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:12,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:13,253 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:13,253 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:13,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:13,266 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:13,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:13,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:13,267 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:13,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:13,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:13,301 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:13,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:13,301 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:13,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:13,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,326 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:13,326 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:37:13,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:13,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:13,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:13,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:37:13,469 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:13,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:13,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:13,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1248 [2022-12-06 07:37:13,469 INFO L420 AbstractCegarLoop]: === Iteration 1250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -546900197, now seen corresponding path program 1 times [2022-12-06 07:37:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:13,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916402390] [2022-12-06 07:37:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:13,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:37:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:13,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916402390] [2022-12-06 07:37:13,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916402390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:13,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:13,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432642376] [2022-12-06 07:37:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:13,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:13,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:13,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:13,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:13,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:13,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:13,791 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:13,791 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:37:13,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13499 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:13,804 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:13,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:13,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:13,805 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:13,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:13,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:13,840 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:13,840 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:13,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:13,840 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:13,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:13,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,865 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:13,865 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:37:13,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:13,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:13,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:14,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:14,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:37:14,005 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:14,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:14,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:14,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:14,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1249 [2022-12-06 07:37:14,005 INFO L420 AbstractCegarLoop]: === Iteration 1251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1195910138, now seen corresponding path program 1 times [2022-12-06 07:37:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:14,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993188354] [2022-12-06 07:37:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37: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:37:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:14,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993188354] [2022-12-06 07:37:14,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993188354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:14,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:14,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805039474] [2022-12-06 07:37:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:14,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:14,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:14,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:14,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:14,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:14,352 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:14,352 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:14,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:14,363 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:14,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:14,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:14,363 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:14,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:14,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:14,394 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:14,394 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:14,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:14,394 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:14,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:14,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,419 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:14,419 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:37:14,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:14,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:14,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:14,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:37:14,559 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:14,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:14,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:14,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1250 [2022-12-06 07:37:14,560 INFO L420 AbstractCegarLoop]: === Iteration 1252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:14,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1356246823, now seen corresponding path program 1 times [2022-12-06 07:37:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:14,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957358243] [2022-12-06 07:37:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:14,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:37:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957358243] [2022-12-06 07:37:14,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957358243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:14,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:14,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414843159] [2022-12-06 07:37:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:14,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:14,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:14,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:14,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:14,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:14,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:14,899 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:14,900 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:37:14,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:14,912 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:14,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:14,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:14,913 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:14,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:14,948 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:14,949 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:14,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:14,949 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:14,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:14,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,973 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:14,973 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:14,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:14,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:14,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:15,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:15,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 07:37:15,143 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:15,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:15,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:15,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:15,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1251 [2022-12-06 07:37:15,143 INFO L420 AbstractCegarLoop]: === Iteration 1253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash 386563512, now seen corresponding path program 1 times [2022-12-06 07:37:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:15,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802583753] [2022-12-06 07:37:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:15,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:37:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:15,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802583753] [2022-12-06 07:37:15,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802583753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:15,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:15,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045816163] [2022-12-06 07:37:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:15,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:15,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:15,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:15,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:15,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:15,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:15,455 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:15,455 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:37:15,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13539 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:15,467 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:15,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:15,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:15,468 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:15,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:15,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:15,499 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:15,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:15,499 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:15,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:15,499 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:15,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:15,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:15,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:15,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:15,532 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:15,532 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:37:15,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:15,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:15,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:15,669 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:15,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:37:15,670 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:15,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:15,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:15,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:15,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1252 [2022-12-06 07:37:15,670 INFO L420 AbstractCegarLoop]: === Iteration 1254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2129373847, now seen corresponding path program 1 times [2022-12-06 07:37:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:15,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32521394] [2022-12-06 07:37:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:15,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:37:15,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:15,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32521394] [2022-12-06 07:37:15,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32521394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:15,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:15,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809755754] [2022-12-06 07:37:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:15,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:15,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:15,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:15,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:15,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:15,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:15,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:15,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:15,990 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:15,991 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:15,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:16,003 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:16,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:16,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:16,004 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:16,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:16,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:16,038 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:16,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:16,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:16,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:16,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:16,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,063 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:16,063 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:37:16,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:16,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:16,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:16,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:37:16,208 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:16,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:16,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:16,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:16,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1253 [2022-12-06 07:37:16,208 INFO L420 AbstractCegarLoop]: === Iteration 1255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -422783114, now seen corresponding path program 1 times [2022-12-06 07:37:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:16,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396918154] [2022-12-06 07:37:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:16,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:37:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:16,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396918154] [2022-12-06 07:37:16,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396918154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:16,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:16,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692803944] [2022-12-06 07:37:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:16,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:16,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:16,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:16,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:16,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:16,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:16,549 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:16,549 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:16,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13560 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:16,562 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:16,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:16,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:16,563 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:16,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:16,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:16,597 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:16,597 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:16,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:16,597 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:16,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:16,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,622 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:16,622 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:16,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:16,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:16,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:16,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:16,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:37:16,756 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:16,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:16,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:16,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:16,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1254 [2022-12-06 07:37:16,756 INFO L420 AbstractCegarLoop]: === Iteration 1256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1320027221, now seen corresponding path program 1 times [2022-12-06 07:37:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:16,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924779198] [2022-12-06 07:37:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:16,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924779198] [2022-12-06 07:37:16,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924779198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:16,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:16,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092229634] [2022-12-06 07:37:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:16,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:16,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:16,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:16,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:16,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:16,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:17,092 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:17,093 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:37:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:17,108 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:17,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:17,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:17,108 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:17,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:17,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:17,147 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:17,147 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:17,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:17,148 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:17,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:17,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,173 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:17,173 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 07:37:17,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:17,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:17,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:17,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:37:17,324 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:17,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:17,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:17,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:17,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1255 [2022-12-06 07:37:17,325 INFO L420 AbstractCegarLoop]: === Iteration 1257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1232129740, now seen corresponding path program 1 times [2022-12-06 07:37:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:17,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299306463] [2022-12-06 07:37:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:17,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:37:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:17,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299306463] [2022-12-06 07:37:17,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299306463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:17,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:17,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:17,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670503489] [2022-12-06 07:37:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:17,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:17,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:17,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:17,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:17,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:17,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:17,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:17,646 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:17,646 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:17,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:17,659 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:17,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:17,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:17,660 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:17,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:17,692 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:17,693 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:17,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:17,693 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:17,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:17,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,718 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:17,718 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:37:17,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:17,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:17,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:17,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:17,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:37:17,863 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:17,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:17,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:17,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:17,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1256 [2022-12-06 07:37:17,863 INFO L420 AbstractCegarLoop]: === Iteration 1258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash 510680595, now seen corresponding path program 1 times [2022-12-06 07:37:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:17,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401528679] [2022-12-06 07:37:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:17,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:37:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:17,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401528679] [2022-12-06 07:37:17,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401528679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:17,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:17,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684221085] [2022-12-06 07:37:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:17,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:17,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:17,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:17,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:17,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:17,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:18,200 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:18,200 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:18,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:18,211 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:18,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:18,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:18,212 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:18,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:18,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:18,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:18,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:18,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:18,242 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:18,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:18,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,266 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:18,266 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:18,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:18,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:18,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:18,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:37:18,427 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:18,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:18,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:18,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:18,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1257 [2022-12-06 07:37:18,427 INFO L420 AbstractCegarLoop]: === Iteration 1259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2041476366, now seen corresponding path program 1 times [2022-12-06 07:37:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:18,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870862445] [2022-12-06 07:37:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:18,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:37:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870862445] [2022-12-06 07:37:18,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870862445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:18,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:18,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818648204] [2022-12-06 07:37:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:18,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:18,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:18,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:18,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:18,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:18,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:18,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:18,758 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:18,759 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:18,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:18,771 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:18,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:18,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:18,771 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:18,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:18,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:18,806 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:18,806 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:18,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:18,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:18,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:18,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,831 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:18,832 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:18,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:18,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:18,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:18,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:18,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:18,978 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:18,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:18,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:18,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1258 [2022-12-06 07:37:18,978 INFO L420 AbstractCegarLoop]: === Iteration 1260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash -298666031, now seen corresponding path program 1 times [2022-12-06 07:37:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:18,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516856821] [2022-12-06 07:37:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:19,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:37:19,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:19,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516856821] [2022-12-06 07:37:19,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516856821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:19,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:19,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:19,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457751840] [2022-12-06 07:37:19,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:19,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:19,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:19,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:19,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:19,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:19,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:19,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:19,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:19,343 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:19,343 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:37:19,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:19,353 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:19,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:19,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:19,354 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:19,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:19,381 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:19,381 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:19,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:19,381 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:19,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:19,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,406 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:19,406 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:37:19,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:19,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:19,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:19,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:37:19,566 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:19,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:19,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:19,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:19,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1259 [2022-12-06 07:37:19,567 INFO L420 AbstractCegarLoop]: === Iteration 1261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1444144304, now seen corresponding path program 1 times [2022-12-06 07:37:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:19,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652007958] [2022-12-06 07:37:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:19,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:37:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:19,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652007958] [2022-12-06 07:37:19,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652007958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:19,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:19,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:19,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205372441] [2022-12-06 07:37:19,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:19,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:19,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:19,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:19,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:19,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:19,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:19,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:19,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:19,893 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:19,893 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:19,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:19,905 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:19,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:19,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:19,906 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:19,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:19,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:19,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:19,940 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:19,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:19,940 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:19,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:19,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,964 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:19,965 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:37:19,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:19,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:19,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:20,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:20,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:37:20,100 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:20,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:20,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:20,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:20,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1260 [2022-12-06 07:37:20,100 INFO L420 AbstractCegarLoop]: === Iteration 1262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1108012657, now seen corresponding path program 1 times [2022-12-06 07:37:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:20,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601799183] [2022-12-06 07:37:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:20,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:37:20,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:20,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601799183] [2022-12-06 07:37:20,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601799183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:20,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:20,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240065570] [2022-12-06 07:37:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:20,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:20,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:20,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:20,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:20,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:20,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:20,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:20,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:20,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:20,427 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:20,428 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:20,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:20,440 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:20,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:20,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:20,441 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:20,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:20,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:20,475 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:20,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:20,475 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:20,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:20,475 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:20,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:20,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:20,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:20,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:20,500 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:20,500 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:20,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:20,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:20,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:20,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:20,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:37:20,654 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:20,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:20,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:20,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:20,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1261 [2022-12-06 07:37:20,655 INFO L420 AbstractCegarLoop]: === Iteration 1263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 634797678, now seen corresponding path program 1 times [2022-12-06 07:37:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811654975] [2022-12-06 07:37:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:20,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:37:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:20,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811654975] [2022-12-06 07:37:20,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811654975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:20,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:20,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129026782] [2022-12-06 07:37:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:20,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:20,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:20,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:20,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:20,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:20,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:20,983 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:20,983 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:20,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:20,998 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:20,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:20,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:20,998 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:20,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:21,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:21,033 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:21,033 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:21,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:21,033 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:21,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:21,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,058 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:21,058 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:21,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:21,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:21,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:21,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:37:21,194 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:21,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:21,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:21,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262 [2022-12-06 07:37:21,194 INFO L420 AbstractCegarLoop]: === Iteration 1264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1917359283, now seen corresponding path program 1 times [2022-12-06 07:37:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:21,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862765434] [2022-12-06 07:37:21,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:21,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:37:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:21,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862765434] [2022-12-06 07:37:21,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862765434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:21,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:21,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557702595] [2022-12-06 07:37:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:21,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:21,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:21,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:21,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:21,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:21,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:21,549 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:21,549 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13495 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:21,562 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:21,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:21,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:21,563 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:21,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:21,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:21,599 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:21,599 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:21,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:21,599 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:21,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:21,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,624 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:21,624 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:21,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:21,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:21,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:21,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:21,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:37:21,769 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:21,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:21,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:21,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:21,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263 [2022-12-06 07:37:21,770 INFO L420 AbstractCegarLoop]: === Iteration 1265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -174548948, now seen corresponding path program 1 times [2022-12-06 07:37:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:21,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64398127] [2022-12-06 07:37:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:21,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64398127] [2022-12-06 07:37:21,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64398127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:21,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708923604] [2022-12-06 07:37:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:21,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:21,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:21,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:21,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:21,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:21,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:21,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:21,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:22,155 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:22,155 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:22,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:22,169 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:22,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:22,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:22,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:22,170 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:22,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:22,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:22,203 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:22,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:22,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:22,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:22,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:22,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,230 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:22,230 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:37:22,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:22,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:22,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:22,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:37:22,393 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:22,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:22,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:22,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:22,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1264 [2022-12-06 07:37:22,393 INFO L420 AbstractCegarLoop]: === Iteration 1266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1568261387, now seen corresponding path program 1 times [2022-12-06 07:37:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:22,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839266331] [2022-12-06 07:37:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:22,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:37:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:22,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839266331] [2022-12-06 07:37:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839266331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:22,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:22,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625993639] [2022-12-06 07:37:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:22,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:22,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:22,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:22,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:22,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:22,768 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:22,768 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:22,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13538 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:22,781 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:22,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:22,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:22,782 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:22,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:22,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:22,815 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,815 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:22,815 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:22,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:22,815 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:22,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:22,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,840 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:22,840 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:22,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:22,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:22,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:22,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:22,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:22,998 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:22,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:22,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:22,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:22,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1265 [2022-12-06 07:37:22,999 INFO L420 AbstractCegarLoop]: === Iteration 1267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -983895574, now seen corresponding path program 1 times [2022-12-06 07:37:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:22,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52246477] [2022-12-06 07:37:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:23,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:37:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:23,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52246477] [2022-12-06 07:37:23,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52246477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:23,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:23,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694205608] [2022-12-06 07:37:23,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:23,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:23,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:23,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:23,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:23,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:23,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:23,347 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:23,347 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:23,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:23,359 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:23,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:23,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:23,359 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:23,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:23,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:23,400 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:23,400 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:23,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:23,400 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:23,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:23,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,426 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:23,426 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:23,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:23,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:23,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:23,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:37:23,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:23,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:23,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:23,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:23,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1266 [2022-12-06 07:37:23,567 INFO L420 AbstractCegarLoop]: === Iteration 1268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash 758914761, now seen corresponding path program 1 times [2022-12-06 07:37:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:23,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652780808] [2022-12-06 07:37:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:23,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:37:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:23,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652780808] [2022-12-06 07:37:23,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652780808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:23,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:23,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548080866] [2022-12-06 07:37:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:23,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:23,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:23,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:23,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:23,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:23,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:23,907 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:23,908 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:23,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:23,920 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:23,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:23,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:23,921 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:23,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:23,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:23,956 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:23,956 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:23,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:23,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:23,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:23,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,981 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:23,982 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 07:37:23,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:23,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:23,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:24,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:24,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:37:24,131 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:24,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:24,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:24,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:24,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1267 [2022-12-06 07:37:24,131 INFO L420 AbstractCegarLoop]: === Iteration 1269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1793242200, now seen corresponding path program 1 times [2022-12-06 07:37:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:24,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959646694] [2022-12-06 07:37:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:24,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:37:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:24,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959646694] [2022-12-06 07:37:24,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959646694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:24,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:24,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:24,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775759935] [2022-12-06 07:37:24,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:24,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:24,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:24,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:24,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:24,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:24,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:24,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:24,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:24,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:24,476 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:24,476 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:37:24,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:24,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:24,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:24,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:24,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:24,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:24,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:24,543 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:24,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:24,543 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:24,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:24,543 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:24,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:24,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:24,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:24,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:24,569 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:24,569 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:37:24,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3010 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:24,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:24,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:24,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:24,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:37:24,712 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:24,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:24,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:24,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:24,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1268 [2022-12-06 07:37:24,712 INFO L420 AbstractCegarLoop]: === Iteration 1270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash -50431865, now seen corresponding path program 1 times [2022-12-06 07:37:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:24,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489564780] [2022-12-06 07:37:24,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:24,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:37:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489564780] [2022-12-06 07:37:24,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489564780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:24,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:24,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782792805] [2022-12-06 07:37:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:24,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:24,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:24,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:24,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:24,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:24,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:24,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:24,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:24,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:25,054 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:25,054 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:37:25,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:25,067 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:25,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:25,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:25,068 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:25,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:25,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:25,101 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:25,102 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:25,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:25,102 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:25,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:25,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,126 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:25,127 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:37:25,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:25,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:25,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:25,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:37:25,268 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:25,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:25,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:25,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1269 [2022-12-06 07:37:25,268 INFO L420 AbstractCegarLoop]: === Iteration 1271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1692378470, now seen corresponding path program 1 times [2022-12-06 07:37:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:25,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155085384] [2022-12-06 07:37:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:25,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:37:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:25,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155085384] [2022-12-06 07:37:25,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155085384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:25,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:25,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658714373] [2022-12-06 07:37:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:25,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:25,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:25,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:25,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:25,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:25,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:25,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:25,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:25,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:25,622 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:25,622 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:25,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:25,636 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:25,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:25,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:25,636 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:25,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:25,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:25,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:25,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:25,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:25,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:25,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:25,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,698 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:25,698 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:37:25,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:25,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:25,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:25,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:25,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:37:25,842 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:25,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:25,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:25,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:25,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1270 [2022-12-06 07:37:25,842 INFO L420 AbstractCegarLoop]: === Iteration 1272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash -859778491, now seen corresponding path program 1 times [2022-12-06 07:37:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:25,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7359430] [2022-12-06 07:37:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:25,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:37:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:25,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7359430] [2022-12-06 07:37:25,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7359430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:25,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:25,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582616361] [2022-12-06 07:37:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:25,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:25,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:25,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:25,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:25,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:25,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:25,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:25,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:26,178 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:26,178 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:37:26,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:26,191 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:26,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:26,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:26,192 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:26,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:26,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:26,224 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:26,224 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:26,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:26,224 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:26,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:26,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,249 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:26,249 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:37:26,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:26,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:26,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:26,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:37:26,398 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:26,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:26,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:26,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:26,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1271 [2022-12-06 07:37:26,398 INFO L420 AbstractCegarLoop]: === Iteration 1273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash 883031844, now seen corresponding path program 1 times [2022-12-06 07:37:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:26,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107166390] [2022-12-06 07:37:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:26,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:37:26,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:26,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107166390] [2022-12-06 07:37:26,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107166390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:26,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:26,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560829670] [2022-12-06 07:37:26,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:26,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:26,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:26,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:26,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:26,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:26,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:26,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:26,730 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:26,730 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:26,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:26,744 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:26,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:26,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:26,745 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:26,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:26,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:26,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:26,780 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:26,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:26,780 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:26,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:26,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,805 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:26,805 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:37:26,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:26,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:26,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:26,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:26,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:37:26,958 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:26,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:26,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:26,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:26,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1272 [2022-12-06 07:37:26,958 INFO L420 AbstractCegarLoop]: === Iteration 1274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1669125117, now seen corresponding path program 1 times [2022-12-06 07:37:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:26,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493115091] [2022-12-06 07:37:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:27,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:37:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493115091] [2022-12-06 07:37:27,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493115091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:27,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:27,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967215465] [2022-12-06 07:37:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:27,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:27,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:27,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:27,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:27,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:27,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:27,288 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:27,288 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:27,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:27,301 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:27,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:27,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:27,302 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:27,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:27,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:27,333 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:27,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:27,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:27,334 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:27,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:27,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,359 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:27,359 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:27,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:27,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:27,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:27,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:37:27,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:27,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:27,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:27,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:27,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1273 [2022-12-06 07:37:27,511 INFO L420 AbstractCegarLoop]: === Iteration 1275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash 73685218, now seen corresponding path program 1 times [2022-12-06 07:37:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:27,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355390902] [2022-12-06 07:37:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:27,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:37:27,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:27,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355390902] [2022-12-06 07:37:27,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355390902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:27,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:27,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479564555] [2022-12-06 07:37:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:27,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:27,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:27,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:27,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:27,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:27,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:27,855 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:27,855 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:27,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:27,868 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:27,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:27,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:27,868 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:27,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:27,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:27,904 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:27,904 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:27,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:27,904 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:27,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:27,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,929 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:27,929 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:27,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:27,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:27,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:28,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:28,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:37:28,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:28,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:28,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:28,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1274 [2022-12-06 07:37:28,087 INFO L420 AbstractCegarLoop]: === Iteration 1276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1816495553, now seen corresponding path program 1 times [2022-12-06 07:37:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757810285] [2022-12-06 07:37:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:28,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:37:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:28,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757810285] [2022-12-06 07:37:28,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757810285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:28,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:28,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083613803] [2022-12-06 07:37:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:28,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:28,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:28,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:28,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:28,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:28,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:28,434 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:28,434 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:28,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:28,444 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:28,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:28,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:28,445 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:28,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:28,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:28,474 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:28,474 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:28,474 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:28,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:28,474 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:28,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:28,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:28,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:28,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:28,498 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:28,499 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:28,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:28,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:28,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:28,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:28,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 07:37:28,645 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:28,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:28,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:28,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1275 [2022-12-06 07:37:28,645 INFO L420 AbstractCegarLoop]: === Iteration 1277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -735661408, now seen corresponding path program 1 times [2022-12-06 07:37:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:28,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611782052] [2022-12-06 07:37:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:28,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:37:28,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:28,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611782052] [2022-12-06 07:37:28,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611782052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:28,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:28,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934131612] [2022-12-06 07:37:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:28,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:28,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:28,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:28,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:28,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:28,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:28,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:28,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:28,977 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:28,977 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:37:28,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:28,990 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:28,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:28,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:28,991 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:28,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:29,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:29,024 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:29,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:29,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:29,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:29,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:29,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,049 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:29,049 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:37:29,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:29,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:29,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:29,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:37:29,194 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:29,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:29,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:29,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:29,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1276 [2022-12-06 07:37:29,195 INFO L420 AbstractCegarLoop]: === Iteration 1278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148927, now seen corresponding path program 1 times [2022-12-06 07:37:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:29,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014109261] [2022-12-06 07:37:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:29,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:37:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:29,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014109261] [2022-12-06 07:37:29,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014109261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:29,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:29,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036766631] [2022-12-06 07:37:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:29,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:29,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:29,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:29,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:29,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:29,527 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:29,527 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:29,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:29,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:29,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:29,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:29,541 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:29,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:29,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:29,573 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:29,573 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:29,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:29,573 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:29,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:29,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:29,604 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:37:29,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:29,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:29,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:29,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:29,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:37:29,750 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:29,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:29,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:29,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:29,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1277 [2022-12-06 07:37:29,750 INFO L420 AbstractCegarLoop]: === Iteration 1279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1545008034, now seen corresponding path program 1 times [2022-12-06 07:37:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:29,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381616786] [2022-12-06 07:37:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:29,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:37:29,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381616786] [2022-12-06 07:37:29,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381616786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:29,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:29,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880707389] [2022-12-06 07:37:29,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:29,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:29,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:29,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:29,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:29,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:29,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:30,074 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:30,074 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:30,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:30,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:30,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:30,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:30,088 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:30,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:30,121 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:30,122 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:30,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:30,122 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:30,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:30,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,146 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:30,146 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:30,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:30,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:30,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:30,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:37:30,283 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:30,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:30,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:30,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:30,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1278 [2022-12-06 07:37:30,283 INFO L420 AbstractCegarLoop]: === Iteration 1280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 197802301, now seen corresponding path program 1 times [2022-12-06 07:37:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:30,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570046530] [2022-12-06 07:37:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:30,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570046530] [2022-12-06 07:37:30,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570046530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:30,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:30,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121251761] [2022-12-06 07:37:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:30,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:30,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:30,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:30,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:30,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:30,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:30,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:30,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:30,632 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:37:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:30,645 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:30,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:30,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:30,645 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:30,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:30,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:30,676 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:30,677 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:30,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:30,677 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:30,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:30,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,702 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:30,702 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:37:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:30,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:30,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:30,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:30,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:30,849 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:30,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:30,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:30,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:30,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1279 [2022-12-06 07:37:30,849 INFO L420 AbstractCegarLoop]: === Iteration 1281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1940612636, now seen corresponding path program 1 times [2022-12-06 07:37:30,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:30,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214825699] [2022-12-06 07:37:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:30,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:30,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:37:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:30,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214825699] [2022-12-06 07:37:30,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214825699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:30,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:30,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535665680] [2022-12-06 07:37:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:30,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:30,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:30,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:30,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:30,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:30,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:30,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:30,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:30,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:31,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:31,196 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:31,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:31,208 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:31,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:31,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:31,209 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:31,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:31,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:31,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:31,242 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:31,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:31,242 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:31,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:31,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,267 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:31,267 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:37:31,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:31,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:31,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:31,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:37:31,427 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:31,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:31,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:31,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:31,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1280 [2022-12-06 07:37:31,427 INFO L420 AbstractCegarLoop]: === Iteration 1282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:31,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash -611544325, now seen corresponding path program 1 times [2022-12-06 07:37:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:31,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816250035] [2022-12-06 07:37:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:31,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:37:31,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:31,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816250035] [2022-12-06 07:37:31,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816250035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:31,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:31,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082554661] [2022-12-06 07:37:31,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:31,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:31,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:31,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:31,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:31,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:31,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:31,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:31,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:31,762 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:31,763 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:31,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:31,775 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:31,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:31,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:31,775 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:31,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:31,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:31,810 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:31,810 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:31,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:31,810 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:31,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:31,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,835 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:31,835 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:37:31,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:31,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:31,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:31,987 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:31,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:37:31,987 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:31,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:31,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:31,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1281 [2022-12-06 07:37:31,987 INFO L420 AbstractCegarLoop]: === Iteration 1283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1131266010, now seen corresponding path program 1 times [2022-12-06 07:37:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364360697] [2022-12-06 07:37:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:32,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:37:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:32,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364360697] [2022-12-06 07:37:32,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364360697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:32,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:32,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197153657] [2022-12-06 07:37:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:32,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:32,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:32,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:32,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:32,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:32,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:32,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:32,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:32,338 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:32,338 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:32,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:32,349 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:32,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:32,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:32,350 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:32,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:32,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:32,381 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:32,381 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:32,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:32,381 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:32,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:32,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,406 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:32,406 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:32,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:32,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:32,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:32,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:37:32,550 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:32,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:32,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:32,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:32,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1282 [2022-12-06 07:37:32,550 INFO L420 AbstractCegarLoop]: === Iteration 1284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1420890951, now seen corresponding path program 1 times [2022-12-06 07:37:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056752217] [2022-12-06 07:37:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:32,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:37:32,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:32,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056752217] [2022-12-06 07:37:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056752217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:32,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:32,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088812735] [2022-12-06 07:37:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:32,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:32,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:32,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:32,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:32,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:32,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:32,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:32,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:32,882 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:32,882 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:37:32,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:32,900 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:32,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:32,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:32,901 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:32,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:32,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:32,937 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:32,937 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:32,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:32,938 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:32,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:32,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,962 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:32,962 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:37:32,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:32,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:32,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:33,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:33,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 07:37:33,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:33,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:33,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:33,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:33,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1283 [2022-12-06 07:37:33,122 INFO L420 AbstractCegarLoop]: === Iteration 1285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash 321919384, now seen corresponding path program 1 times [2022-12-06 07:37:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:33,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129750390] [2022-12-06 07:37:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:33,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:37:33,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:33,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129750390] [2022-12-06 07:37:33,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129750390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:33,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:33,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195865112] [2022-12-06 07:37:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:33,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:33,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:33,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:33,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:33,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:33,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:33,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:33,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:33,481 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:33,481 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:33,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:33,491 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:33,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:33,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:33,492 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:33,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:33,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:33,523 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:33,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:33,523 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:33,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:33,523 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:33,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:33,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:33,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:33,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:33,548 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:33,548 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:37:33,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:33,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:33,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:33,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:33,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:37:33,696 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:33,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:33,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:33,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:33,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1284 [2022-12-06 07:37:33,697 INFO L420 AbstractCegarLoop]: === Iteration 1286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2064729719, now seen corresponding path program 1 times [2022-12-06 07:37:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:33,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374285200] [2022-12-06 07:37:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:33,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:37:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:33,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374285200] [2022-12-06 07:37:33,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374285200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:33,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:33,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014855597] [2022-12-06 07:37:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:33,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:33,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:33,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:33,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:33,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:33,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:33,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:33,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:33,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:34,043 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:34,043 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:34,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:34,057 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:34,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:34,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:34,057 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:34,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:34,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:34,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:34,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:34,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:34,094 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:34,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:34,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,118 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:34,119 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:37:34,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:34,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:34,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:34,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:37:34,260 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:34,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:34,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:34,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:34,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1285 [2022-12-06 07:37:34,260 INFO L420 AbstractCegarLoop]: === Iteration 1287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -487427242, now seen corresponding path program 1 times [2022-12-06 07:37:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:34,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307985795] [2022-12-06 07:37:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:34,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:37:34,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:34,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307985795] [2022-12-06 07:37:34,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307985795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:34,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:34,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398294964] [2022-12-06 07:37:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:34,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:34,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:34,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:34,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:34,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:34,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:34,606 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:34,606 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:34,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:34,620 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:34,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:34,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:34,621 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:34,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:34,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:34,656 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:34,656 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:34,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:34,656 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:34,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:34,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:34,690 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:34,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:34,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:34,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:34,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:34,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:37:34,831 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:34,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:34,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:34,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:34,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1286 [2022-12-06 07:37:34,831 INFO L420 AbstractCegarLoop]: === Iteration 1288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1255383093, now seen corresponding path program 1 times [2022-12-06 07:37:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:34,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206522243] [2022-12-06 07:37:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:34,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:37:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206522243] [2022-12-06 07:37:34,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206522243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:34,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:34,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802679870] [2022-12-06 07:37:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:34,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:34,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:34,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:34,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:34,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:34,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:34,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:35,164 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:35,165 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:35,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:35,178 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:35,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:35,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:35,178 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:35,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:35,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:35,212 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:35,212 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:35,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:35,212 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:35,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:35,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,237 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:35,237 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:35,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:35,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:35,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:35,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:35,384 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:35,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:35,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:35,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:35,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1287 [2022-12-06 07:37:35,384 INFO L420 AbstractCegarLoop]: === Iteration 1289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1296773868, now seen corresponding path program 1 times [2022-12-06 07:37:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:35,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487211891] [2022-12-06 07:37:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:35,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:37:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:35,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487211891] [2022-12-06 07:37:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487211891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:35,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:35,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879518819] [2022-12-06 07:37:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:35,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:35,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:35,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:35,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:35,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:35,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:35,712 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:35,713 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:35,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:35,728 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:35,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:35,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:35,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:35,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:35,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:35,766 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:35,766 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:35,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:35,766 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:35,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:35,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,793 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:35,793 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:37:35,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:35,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:35,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:35,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:35,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:37:35,929 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:35,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:35,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:35,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:35,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1288 [2022-12-06 07:37:35,929 INFO L420 AbstractCegarLoop]: === Iteration 1290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 446036467, now seen corresponding path program 1 times [2022-12-06 07:37:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:35,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896235272] [2022-12-06 07:37:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:36,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:37:36,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:36,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896235272] [2022-12-06 07:37:36,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896235272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:36,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:36,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4139445] [2022-12-06 07:37:36,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:36,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:36,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:36,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:36,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:36,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:36,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:36,285 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:36,285 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:36,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:36,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:36,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:36,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:36,299 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:36,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:36,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:36,334 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:36,335 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:36,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:36,335 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:36,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:36,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,360 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:36,360 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:37:36,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:36,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:36,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:36,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:37:36,512 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:36,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:36,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:36,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:36,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1289 [2022-12-06 07:37:36,513 INFO L420 AbstractCegarLoop]: === Iteration 1291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2106120494, now seen corresponding path program 1 times [2022-12-06 07:37:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:36,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887819358] [2022-12-06 07:37:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:36,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:37:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887819358] [2022-12-06 07:37:36,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887819358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:36,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:36,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043647329] [2022-12-06 07:37:36,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:36,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:36,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:36,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:36,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:36,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:36,880 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:36,880 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:36,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:36,895 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:36,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:36,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:36,896 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:36,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:36,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:36,930 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:36,930 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:36,930 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:36,930 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:36,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:36,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,955 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:36,955 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:37:36,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:36,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:36,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:37,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:37,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:37:37,100 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:37,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:37,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:37,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:37,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1290 [2022-12-06 07:37:37,100 INFO L420 AbstractCegarLoop]: === Iteration 1292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -363310159, now seen corresponding path program 1 times [2022-12-06 07:37:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458567106] [2022-12-06 07:37:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:37,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:37:37,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:37,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458567106] [2022-12-06 07:37:37,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458567106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:37,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:37,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326172449] [2022-12-06 07:37:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:37,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:37,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:37,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:37,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:37,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:37,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:37,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:37,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:37,450 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:37,450 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:37:37,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:37,462 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:37,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:37,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:37,463 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:37,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:37,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:37,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:37,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:37,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:37,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:37,494 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:37,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:37,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:37,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:37,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:37,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:37,520 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:37:37,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:37,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:37,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:37,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:37,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:37:37,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:37,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:37,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:37,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:37,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1291 [2022-12-06 07:37:37,661 INFO L420 AbstractCegarLoop]: === Iteration 1293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1379500176, now seen corresponding path program 1 times [2022-12-06 07:37:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:37,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814042282] [2022-12-06 07:37:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:37,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:37,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:37:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814042282] [2022-12-06 07:37:37,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814042282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:37,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:37,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983726153] [2022-12-06 07:37:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:37,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:37,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:37,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:37,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:37,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:37,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:38,007 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:38,007 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:38,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:38,020 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:38,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:38,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:38,021 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:38,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:38,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:38,059 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:38,059 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:38,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:38,059 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:38,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:38,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,085 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:38,085 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:37:38,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:38,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:38,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:38,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:38,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:38,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:38,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:38,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:38,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292 [2022-12-06 07:37:38,243 INFO L420 AbstractCegarLoop]: === Iteration 1294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1172656785, now seen corresponding path program 1 times [2022-12-06 07:37:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125633138] [2022-12-06 07:37:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:38,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:37:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:38,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125633138] [2022-12-06 07:37:38,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125633138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:38,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:38,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120259303] [2022-12-06 07:37:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:38,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:38,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:38,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:38,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:38,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:38,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:38,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:38,612 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:38,612 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:38,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:38,623 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:38,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:38,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:38,624 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:38,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:38,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:38,653 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:38,653 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:38,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:38,653 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:38,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:38,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,678 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:38,679 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:37:38,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:38,682 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:38,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:38,828 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:38,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:37:38,829 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:38,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:38,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:38,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:38,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1293 [2022-12-06 07:37:38,829 INFO L420 AbstractCegarLoop]: === Iteration 1295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:38,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 570153550, now seen corresponding path program 1 times [2022-12-06 07:37:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989384580] [2022-12-06 07:37:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:38,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:37:38,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:38,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989384580] [2022-12-06 07:37:38,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989384580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:38,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292604947] [2022-12-06 07:37:38,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:38,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:38,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:38,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:38,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:38,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:38,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:38,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:38,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:39,184 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:39,184 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:39,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:39,197 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:39,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:39,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:39,198 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:39,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:39,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:39,234 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,234 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:39,234 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:39,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:39,234 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,235 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:39,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:39,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,258 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:39,259 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:37:39,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:39,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:39,402 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:39,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:37:39,403 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:39,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:39,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:39,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1294 [2022-12-06 07:37:39,403 INFO L420 AbstractCegarLoop]: === Iteration 1296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1982003411, now seen corresponding path program 1 times [2022-12-06 07:37:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:39,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759187358] [2022-12-06 07:37:39,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37: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:37:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:39,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759187358] [2022-12-06 07:37:39,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759187358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:39,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:39,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769744332] [2022-12-06 07:37:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:39,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:39,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:39,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:39,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:39,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:39,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:39,719 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:39,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:39,732 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:39,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:39,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:39,733 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:39,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:39,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:39,767 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:39,767 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:39,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:39,767 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:39,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:39,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,792 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:39,792 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:37:39,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:39,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:39,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:39,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:39,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:39,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:39,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:39,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:39,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:39,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1295 [2022-12-06 07:37:39,950 INFO L420 AbstractCegarLoop]: === Iteration 1297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash -239193076, now seen corresponding path program 1 times [2022-12-06 07:37:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:39,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825423346] [2022-12-06 07:37:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:40,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:37:40,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:40,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825423346] [2022-12-06 07:37:40,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825423346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:40,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:40,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400480432] [2022-12-06 07:37:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:40,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:40,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:40,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:40,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:40,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:40,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:40,292 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:40,292 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:37:40,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:40,304 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:40,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:40,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:40,305 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:40,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:40,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:40,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:40,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:40,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:40,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:40,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:40,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,363 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:40,363 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:37:40,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:40,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:40,511 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:40,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:37:40,512 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:40,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:40,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:40,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:40,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1296 [2022-12-06 07:37:40,512 INFO L420 AbstractCegarLoop]: === Iteration 1298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1503617259, now seen corresponding path program 1 times [2022-12-06 07:37:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:40,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651152623] [2022-12-06 07:37:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:40,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:37:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:40,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651152623] [2022-12-06 07:37:40,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651152623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:40,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:40,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233734103] [2022-12-06 07:37:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:40,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:40,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:40,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:40,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:40,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:40,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:40,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:40,871 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:40,871 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:40,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:40,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:40,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:40,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:40,885 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:40,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:40,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:40,920 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:40,920 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:40,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:40,920 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:40,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:40,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,946 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:40,946 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:40,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:40,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:40,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:41,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:41,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:37:41,082 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:41,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:41,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:41,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1297 [2022-12-06 07:37:41,082 INFO L420 AbstractCegarLoop]: === Iteration 1299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:41,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1048539702, now seen corresponding path program 1 times [2022-12-06 07:37:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:41,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199138029] [2022-12-06 07:37:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:41,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:41,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:37:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:41,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199138029] [2022-12-06 07:37:41,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199138029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:41,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667761080] [2022-12-06 07:37:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:41,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:41,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:41,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:41,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:41,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:41,430 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:41,431 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:41,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:41,443 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:41,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:41,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:41,443 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:41,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:41,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:41,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:41,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:41,477 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:41,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:41,477 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:41,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:41,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:41,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:41,501 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:41,501 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:41,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:41,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:41,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:41,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:41,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:41,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:41,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1298 [2022-12-06 07:37:41,660 INFO L420 AbstractCegarLoop]: === Iteration 1300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 694270633, now seen corresponding path program 1 times [2022-12-06 07:37:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:41,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469759740] [2022-12-06 07:37:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:41,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:37:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:41,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469759740] [2022-12-06 07:37:41,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469759740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:41,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:41,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:41,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105192030] [2022-12-06 07:37:41,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:41,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:41,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:41,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:41,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:41,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:41,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:41,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:42,011 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:42,012 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:42,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:42,025 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:42,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:42,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:42,026 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:42,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:42,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:42,064 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:42,064 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:42,064 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:42,064 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:42,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:42,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,090 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:42,090 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:42,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:42,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:42,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:42,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:37:42,234 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:42,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:42,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:42,234 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:42,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1299 [2022-12-06 07:37:42,234 INFO L420 AbstractCegarLoop]: === Iteration 1301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1857886328, now seen corresponding path program 1 times [2022-12-06 07:37:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:42,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118259938] [2022-12-06 07:37:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:42,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:37:42,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:42,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118259938] [2022-12-06 07:37:42,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118259938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:42,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:42,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446225975] [2022-12-06 07:37:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:42,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:42,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:42,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:42,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:42,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:42,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:42,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:42,590 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:42,590 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:37:42,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13527 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:42,602 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:42,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:42,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:42,603 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:42,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:42,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:42,632 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:42,632 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:42,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:42,632 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:42,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:42,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,658 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:42,658 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 07:37:42,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:42,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:42,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:42,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:42,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:37:42,806 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:42,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:42,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:42,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:42,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1300 [2022-12-06 07:37:42,806 INFO L420 AbstractCegarLoop]: === Iteration 1302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash -115075993, now seen corresponding path program 1 times [2022-12-06 07:37:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:42,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782247594] [2022-12-06 07:37:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:42,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:37:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:42,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782247594] [2022-12-06 07:37:42,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782247594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:42,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982093996] [2022-12-06 07:37:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:42,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:42,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:42,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:42,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:42,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:42,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:42,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:43,140 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:43,140 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:43,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:43,153 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:43,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:43,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:43,154 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:43,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:43,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:43,188 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:43,188 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:43,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:43,188 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:43,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:43,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,213 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:43,213 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:43,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:43,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:43,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:43,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:37:43,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:43,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:43,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:43,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:43,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1301 [2022-12-06 07:37:43,366 INFO L420 AbstractCegarLoop]: === Iteration 1303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1627734342, now seen corresponding path program 1 times [2022-12-06 07:37:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:43,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672342759] [2022-12-06 07:37:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:43,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:37:43,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:43,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672342759] [2022-12-06 07:37:43,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672342759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:43,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:43,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403837561] [2022-12-06 07:37:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:43,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:43,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:43,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:43,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:43,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:43,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:43,694 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:43,695 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:43,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:43,707 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:43,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:43,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:43,707 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:43,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:43,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:43,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:43,761 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:43,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:43,761 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:43,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:43,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,786 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:43,786 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:43,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:43,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:43,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:43,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:43,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 07:37:43,928 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:43,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:43,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:43,928 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:43,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1302 [2022-12-06 07:37:43,928 INFO L420 AbstractCegarLoop]: === Iteration 1304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash -924422619, now seen corresponding path program 1 times [2022-12-06 07:37:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:43,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841032248] [2022-12-06 07:37:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:43,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:37:43,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:43,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841032248] [2022-12-06 07:37:43,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841032248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:43,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:43,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797613806] [2022-12-06 07:37:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:43,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:43,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:43,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:43,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:43,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:43,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:43,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:44,273 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:44,274 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:44,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:44,288 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:44,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:44,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:44,288 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:44,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:44,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:44,327 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:44,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:44,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:44,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:44,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:44,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,354 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:44,354 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:44,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:44,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:44,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 07:37:44,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:44,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:44,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:44,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:44,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1303 [2022-12-06 07:37:44,524 INFO L420 AbstractCegarLoop]: === Iteration 1305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 818387716, now seen corresponding path program 1 times [2022-12-06 07:37:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497213034] [2022-12-06 07:37:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:44,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:37:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497213034] [2022-12-06 07:37:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497213034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:44,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139496914] [2022-12-06 07:37:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:44,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:44,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:44,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:44,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:44,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:44,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:44,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:44,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:44,870 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:44,870 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:44,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:44,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:44,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:44,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:44,884 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:44,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:44,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:44,918 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:44,918 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:44,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:44,918 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:44,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:44,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,943 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:44,943 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 07:37:44,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:44,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:44,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:45,077 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:45,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:37:45,077 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:45,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:45,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:45,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:45,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1304 [2022-12-06 07:37:45,077 INFO L420 AbstractCegarLoop]: === Iteration 1306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1733769245, now seen corresponding path program 1 times [2022-12-06 07:37:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:45,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053166696] [2022-12-06 07:37:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:45,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:37:45,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:45,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053166696] [2022-12-06 07:37:45,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053166696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:45,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:45,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304974036] [2022-12-06 07:37:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:45,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:45,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:45,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:45,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:45,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:45,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:45,405 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:45,405 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:45,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:45,418 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:45,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:45,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:45,419 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:45,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:45,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:45,456 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:45,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:45,456 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:45,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:45,456 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:45,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:45,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:45,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:45,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:45,481 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:45,482 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:45,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:45,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:45,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:45,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:45,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:37:45,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:45,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:45,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:45,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:45,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1305 [2022-12-06 07:37:45,635 INFO L420 AbstractCegarLoop]: === Iteration 1307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash 9041090, now seen corresponding path program 1 times [2022-12-06 07:37:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:45,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437566910] [2022-12-06 07:37:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37: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:37:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:45,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437566910] [2022-12-06 07:37:45,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437566910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:45,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:45,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337687672] [2022-12-06 07:37:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:45,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:45,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:45,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:45,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:45,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:45,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:45,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:45,970 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:45,970 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:45,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13513 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:45,983 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:45,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:45,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:45,984 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:45,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:46,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:46,020 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:46,021 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:46,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:46,021 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:46,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:46,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,045 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:46,046 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 07:37:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:46,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:46,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:46,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 07:37:46,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:46,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:46,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:46,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:46,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1306 [2022-12-06 07:37:46,203 INFO L420 AbstractCegarLoop]: === Iteration 1308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1751851425, now seen corresponding path program 1 times [2022-12-06 07:37:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:46,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856510466] [2022-12-06 07:37:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:46,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:37:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:46,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856510466] [2022-12-06 07:37:46,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856510466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:46,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:46,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027145222] [2022-12-06 07:37:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:46,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:46,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:46,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:46,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:46,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:46,534 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:46,534 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:46,546 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:46,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:46,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:46,547 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:46,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:46,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:46,579 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:46,580 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:46,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:46,580 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:46,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:46,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,605 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:46,605 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:46,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:46,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:46,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:46,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:46,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:37:46,744 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:46,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:46,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:46,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:46,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1307 [2022-12-06 07:37:46,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 (and 1 more)] === [2022-12-06 07:37:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash -800305536, now seen corresponding path program 1 times [2022-12-06 07:37:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:46,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495536268] [2022-12-06 07:37:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:46,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:37:46,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:46,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495536268] [2022-12-06 07:37:46,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495536268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:46,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:46,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291139849] [2022-12-06 07:37:46,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:46,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:46,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:46,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:46,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:46,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:46,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:46,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:47,069 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:47,069 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:47,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:47,084 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:47,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:47,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:47,085 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:47,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:47,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:47,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:47,123 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:47,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:47,123 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:47,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:47,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,149 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:47,149 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 07:37:47,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:47,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:47,294 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:47,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:47,295 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:47,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:47,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:47,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1308 [2022-12-06 07:37:47,295 INFO L420 AbstractCegarLoop]: === Iteration 1310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 942504799, now seen corresponding path program 1 times [2022-12-06 07:37:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:47,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925714051] [2022-12-06 07:37:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:47,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:37:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:47,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925714051] [2022-12-06 07:37:47,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925714051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:47,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:47,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36743065] [2022-12-06 07:37:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:47,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:47,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:47,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:47,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:47,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:47,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:47,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:47,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:47,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:47,663 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:47,663 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:37:47,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:47,674 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:47,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:47,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:47,675 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:47,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:47,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:47,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:47,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:47,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:47,707 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:47,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:47,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,732 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:47,732 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:47,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:47,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:47,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:47,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:47,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 07:37:47,896 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:47,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:47,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:47,896 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:47,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1309 [2022-12-06 07:37:47,896 INFO L420 AbstractCegarLoop]: === Iteration 1311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1609652162, now seen corresponding path program 1 times [2022-12-06 07:37:47,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:47,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256222003] [2022-12-06 07:37:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256222003] [2022-12-06 07:37:47,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256222003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:47,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:47,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070779301] [2022-12-06 07:37:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:47,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:47,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:47,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:47,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:47,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:47,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:47,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:48,244 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:48,244 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:37:48,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:48,257 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:48,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:48,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:48,258 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:48,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:48,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:48,293 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:48,293 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:48,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:48,294 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:48,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:48,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,318 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:48,318 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:37:48,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:48,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:48,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:48,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:37:48,470 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:48,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:48,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:48,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1310 [2022-12-06 07:37:48,470 INFO L420 AbstractCegarLoop]: === Iteration 1312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:48,470 INFO L85 PathProgramCache]: Analyzing trace with hash 133158173, now seen corresponding path program 1 times [2022-12-06 07:37:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:48,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935377077] [2022-12-06 07:37:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:48,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:37:48,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:48,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935377077] [2022-12-06 07:37:48,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935377077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:48,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:48,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229519158] [2022-12-06 07:37:48,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:48,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:48,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:48,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:48,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:48,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:48,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:48,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:48,817 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:48,817 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:48,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:48,831 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:48,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:48,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:48,832 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:48,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:48,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:48,872 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:48,872 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:48,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:48,872 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:48,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:48,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,905 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:48,905 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:48,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:48,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:48,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:49,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:49,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:37:49,051 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:49,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:49,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:49,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:49,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1311 [2022-12-06 07:37:49,051 INFO L420 AbstractCegarLoop]: === Iteration 1313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1875968508, now seen corresponding path program 1 times [2022-12-06 07:37:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683412536] [2022-12-06 07:37:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:49,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:37:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683412536] [2022-12-06 07:37:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683412536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066441153] [2022-12-06 07:37:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:49,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:49,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:49,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:49,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:49,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:49,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:49,367 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:49,368 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:49,381 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:49,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:49,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:49,382 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:49,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:49,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:49,416 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:49,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:49,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:49,416 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:49,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:49,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,441 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:49,441 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:37:49,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:49,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:49,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:49,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:37:49,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:49,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:49,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:49,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1312 [2022-12-06 07:37:49,590 INFO L420 AbstractCegarLoop]: === Iteration 1314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -676188453, now seen corresponding path program 1 times [2022-12-06 07:37:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:49,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699490173] [2022-12-06 07:37:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:49,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:37:49,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:49,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699490173] [2022-12-06 07:37:49,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699490173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:49,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:49,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:49,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353466176] [2022-12-06 07:37:49,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:49,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:49,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:49,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:49,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:49,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:49,947 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:49,947 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:49,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:49,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:49,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:49,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:49,962 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:49,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:49,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:49,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:49,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:49,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:49,996 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:49,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:49,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:49,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,021 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:50,021 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:50,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:50,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:50,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:50,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:50,168 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:50,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:50,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:50,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:50,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1313 [2022-12-06 07:37:50,168 INFO L420 AbstractCegarLoop]: === Iteration 1315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:50,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1066621882, now seen corresponding path program 1 times [2022-12-06 07:37:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:50,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408170109] [2022-12-06 07:37:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:50,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:50,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:37:50,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:50,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408170109] [2022-12-06 07:37:50,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408170109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:50,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:50,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558471394] [2022-12-06 07:37:50,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:50,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:50,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:50,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:50,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:50,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:50,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:50,506 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:50,506 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:50,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:50,520 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:50,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:50,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:50,520 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:50,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:50,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:50,555 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:50,555 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:50,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:50,555 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:50,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:50,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,581 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:50,581 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:50,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:50,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:50,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:50,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:50,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:37:50,735 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:50,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:50,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:50,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:50,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1314 [2022-12-06 07:37:50,735 INFO L420 AbstractCegarLoop]: === Iteration 1316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1485535079, now seen corresponding path program 1 times [2022-12-06 07:37:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012726291] [2022-12-06 07:37:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:50,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:37:50,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:50,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012726291] [2022-12-06 07:37:50,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012726291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:50,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:50,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:50,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879615873] [2022-12-06 07:37:50,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:50,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:50,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:50,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:50,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:50,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:50,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:50,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:51,075 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:51,075 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:51,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:51,090 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:51,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:51,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:51,091 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:51,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:51,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:51,130 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:51,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:51,130 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:51,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:51,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,156 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:51,156 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 07:37:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:51,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:51,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:51,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 07:37:51,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:51,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:51,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:51,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1315 [2022-12-06 07:37:51,308 INFO L420 AbstractCegarLoop]: === Iteration 1317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:51,309 INFO L85 PathProgramCache]: Analyzing trace with hash 257275256, now seen corresponding path program 1 times [2022-12-06 07:37:51,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:51,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980826585] [2022-12-06 07:37:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:51,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:37:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:51,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980826585] [2022-12-06 07:37:51,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980826585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:51,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:51,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897399055] [2022-12-06 07:37:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:51,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:51,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:51,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:51,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:51,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:51,665 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:51,665 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:51,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:51,678 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:51,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:51,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:51,679 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:51,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:51,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:51,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:51,714 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:51,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:51,714 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:51,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:51,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,740 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:51,740 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:37:51,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:51,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:51,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:51,908 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:51,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 07:37:51,908 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:51,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:51,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:51,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1316 [2022-12-06 07:37:51,909 INFO L420 AbstractCegarLoop]: === Iteration 1318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:51,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2000085591, now seen corresponding path program 1 times [2022-12-06 07:37:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:51,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574490707] [2022-12-06 07:37:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:51,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:37:51,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:51,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574490707] [2022-12-06 07:37:51,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574490707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:51,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:51,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41604496] [2022-12-06 07:37:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:51,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:51,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:51,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:51,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:52,264 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:52,264 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:52,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:52,280 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:52,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:52,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:52,281 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:52,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:52,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:52,318 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:52,318 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:52,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:52,318 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:52,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:52,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,344 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:52,344 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:52,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:52,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:52,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:52,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 07:37:52,513 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:52,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:52,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:52,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1317 [2022-12-06 07:37:52,513 INFO L420 AbstractCegarLoop]: === Iteration 1319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -552071370, now seen corresponding path program 1 times [2022-12-06 07:37:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:52,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713239811] [2022-12-06 07:37:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:52,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:37:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713239811] [2022-12-06 07:37:52,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713239811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:52,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:52,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205005703] [2022-12-06 07:37:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:52,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:52,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:52,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:52,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:52,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:52,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:52,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:52,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:52,899 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:52,899 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:52,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:52,912 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:52,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:52,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:52,913 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:52,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:52,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:52,945 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:52,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:52,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:52,946 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:52,946 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:52,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,971 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:52,971 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:52,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:52,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:53,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:53,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:53,129 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:53,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:53,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:53,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1318 [2022-12-06 07:37:53,129 INFO L420 AbstractCegarLoop]: === Iteration 1320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1190738965, now seen corresponding path program 1 times [2022-12-06 07:37:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:53,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382858987] [2022-12-06 07:37:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:53,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382858987] [2022-12-06 07:37:53,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382858987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:53,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:53,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:53,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786374240] [2022-12-06 07:37:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:53,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:53,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:53,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:53,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:53,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:53,476 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:53,476 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 07:37:53,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:53,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:53,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:53,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:53,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:53,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:53,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:53,525 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:53,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:53,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:53,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:53,526 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:53,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:53,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:53,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:53,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:53,550 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:53,551 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:53,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:53,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:53,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:53,698 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:53,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:37:53,698 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:53,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:53,698 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:53,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1319 [2022-12-06 07:37:53,698 INFO L420 AbstractCegarLoop]: === Iteration 1321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1361417996, now seen corresponding path program 1 times [2022-12-06 07:37:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:53,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18903384] [2022-12-06 07:37:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:53,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:37:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:53,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18903384] [2022-12-06 07:37:53,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18903384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:53,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:53,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155444762] [2022-12-06 07:37:53,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:53,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:53,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:53,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:53,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:53,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:53,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:54,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:54,037 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:37:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:54,051 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:54,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:54,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:54,052 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:54,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:54,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:54,086 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:54,086 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:54,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:54,086 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:54,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:54,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,121 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:54,121 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 07:37:54,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:54,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:54,268 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:54,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 07:37:54,269 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:54,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:54,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:54,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1320 [2022-12-06 07:37:54,269 INFO L420 AbstractCegarLoop]: === Iteration 1322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:54,269 INFO L85 PathProgramCache]: Analyzing trace with hash 381392339, now seen corresponding path program 1 times [2022-12-06 07:37:54,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:54,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663065257] [2022-12-06 07:37:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:54,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:37:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663065257] [2022-12-06 07:37:54,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663065257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:54,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:54,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893671814] [2022-12-06 07:37:54,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:54,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:54,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:54,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:54,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:54,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:54,614 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:54,614 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:37:54,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:54,627 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:54,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:54,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:54,628 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:54,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:54,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:54,661 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:54,661 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:54,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:54,661 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:54,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:54,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,686 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:54,686 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:37:54,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:54,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:54,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:54,833 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:54,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:37:54,834 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:54,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:54,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:54,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1321 [2022-12-06 07:37:54,834 INFO L420 AbstractCegarLoop]: === Iteration 1323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2124202674, now seen corresponding path program 1 times [2022-12-06 07:37:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:54,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791444563] [2022-12-06 07:37:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:54,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:37:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:54,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791444563] [2022-12-06 07:37:54,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791444563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:54,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:54,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436158597] [2022-12-06 07:37:54,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:54,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:54,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:54,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:54,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:54,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:54,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:54,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:55,170 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:55,170 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:55,183 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:55,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:55,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:55,184 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:55,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:55,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:55,219 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:55,219 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:55,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:55,219 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:55,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:55,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,244 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:55,244 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:37:55,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:55,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:55,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:55,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:37:55,384 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:55,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:55,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:55,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:55,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1322 [2022-12-06 07:37:55,384 INFO L420 AbstractCegarLoop]: === Iteration 1324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash -427954287, now seen corresponding path program 1 times [2022-12-06 07:37:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:55,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898114276] [2022-12-06 07:37:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898114276] [2022-12-06 07:37:55,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898114276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:55,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:55,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173616129] [2022-12-06 07:37:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:55,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:55,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:55,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:55,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:55,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:55,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:55,749 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:37:55,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:55,762 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:55,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:55,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:55,763 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:55,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:55,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:55,800 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:55,801 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:55,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:55,801 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:55,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:55,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,826 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:37:55,826 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:37:55,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:37:55,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:55,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:55,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:55,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:37:55,980 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:55,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:55,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:55,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:55,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1323 [2022-12-06 07:37:55,980 INFO L420 AbstractCegarLoop]: === Iteration 1325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1314856048, now seen corresponding path program 1 times [2022-12-06 07:37:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:55,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84595669] [2022-12-06 07:37:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:56,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:37:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:56,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84595669] [2022-12-06 07:37:56,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84595669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:56,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:56,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967267641] [2022-12-06 07:37:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:56,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:56,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:56,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:56,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:56,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:56,317 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:56,318 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:56,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:56,331 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:56,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:56,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:56,331 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:56,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:56,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:56,367 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:56,367 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:56,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:56,367 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:56,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:56,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,392 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:56,392 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 07:37:56,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:56,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:56,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:56,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:37:56,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:56,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:56,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:56,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:56,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1324 [2022-12-06 07:37:56,531 INFO L420 AbstractCegarLoop]: === Iteration 1326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:56,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1237300913, now seen corresponding path program 1 times [2022-12-06 07:37:56,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:56,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240274594] [2022-12-06 07:37:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:56,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:37:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:56,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240274594] [2022-12-06 07:37:56,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240274594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:56,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:56,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224919824] [2022-12-06 07:37:56,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:56,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:56,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:56,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:56,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:56,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:56,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:56,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:56,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:56,865 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:56,865 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:56,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:56,877 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:56,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:56,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:56,878 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:56,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:56,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:56,910 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:56,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:56,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:56,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:56,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:56,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,935 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:56,935 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 07:37:56,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:56,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:56,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:57,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:57,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:37:57,073 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:57,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:57,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:57,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:57,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1325 [2022-12-06 07:37:57,074 INFO L420 AbstractCegarLoop]: === Iteration 1327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 505509422, now seen corresponding path program 1 times [2022-12-06 07:37:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:57,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074325169] [2022-12-06 07:37:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:57,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:37:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074325169] [2022-12-06 07:37:57,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074325169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:57,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:57,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864879098] [2022-12-06 07:37:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:57,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:57,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:57,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:57,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:57,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:57,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:57,396 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:57,396 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:57,410 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:57,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:57,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:57,411 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:57,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:57,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:57,444 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:57,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:57,445 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:57,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:57,445 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:57,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:57,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:57,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:57,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:57,470 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:57,470 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:37:57,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:57,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:57,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:57,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:57,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:37:57,615 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:57,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:57,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:57,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:57,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1326 [2022-12-06 07:37:57,616 INFO L420 AbstractCegarLoop]: === Iteration 1328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2046647539, now seen corresponding path program 1 times [2022-12-06 07:37:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561505542] [2022-12-06 07:37:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37: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:37:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561505542] [2022-12-06 07:37:57,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561505542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:57,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:57,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561263285] [2022-12-06 07:37:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:57,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:57,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:57,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:57,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:57,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:57,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:57,975 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:57,975 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:57,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:57,985 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:57,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:57,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:57,986 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:57,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:58,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:58,017 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:58,018 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:58,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:58,018 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:58,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:58,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,043 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:58,043 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:58,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:58,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:58,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:58,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:37:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:58,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:58,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:58,180 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:58,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1327 [2022-12-06 07:37:58,180 INFO L420 AbstractCegarLoop]: === Iteration 1329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash -303837204, now seen corresponding path program 1 times [2022-12-06 07:37:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:58,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993916104] [2022-12-06 07:37:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:58,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:37:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:58,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993916104] [2022-12-06 07:37:58,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993916104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:58,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:58,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245142477] [2022-12-06 07:37:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:58,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:58,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:58,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:58,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:58,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:58,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:58,520 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:58,520 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:58,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:58,535 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:58,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:58,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:58,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:58,535 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:58,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:58,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:58,571 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:58,571 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:58,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:58,571 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:58,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:58,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,610 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:58,610 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:37:58,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:58,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:58,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:58,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:58,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 07:37:58,773 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:58,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:58,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:58,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1328 [2022-12-06 07:37:58,773 INFO L420 AbstractCegarLoop]: === Iteration 1330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1438973131, now seen corresponding path program 1 times [2022-12-06 07:37:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297738717] [2022-12-06 07:37:58,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:58,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:37:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:58,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297738717] [2022-12-06 07:37:58,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297738717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:58,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:58,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343756675] [2022-12-06 07:37:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:58,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:58,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:58,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:58,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:58,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:59,116 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:59,116 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:37:59,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:59,130 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:59,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:59,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:59,130 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:59,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:59,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:59,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:59,164 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:59,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:59,164 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:59,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:59,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,189 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:59,189 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:37:59,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:59,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:59,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:59,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:37:59,338 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:59,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:59,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:59,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:59,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1329 [2022-12-06 07:37:59,338 INFO L420 AbstractCegarLoop]: === Iteration 1331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1113183830, now seen corresponding path program 1 times [2022-12-06 07:37:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802510104] [2022-12-06 07:37:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:59,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:37:59,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:59,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802510104] [2022-12-06 07:37:59,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802510104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:59,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:59,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754823436] [2022-12-06 07:37:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:59,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:59,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:59,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:59,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:59,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:59,663 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:37:59,663 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:37:59,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:37:59,676 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:37:59,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:37:59,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:37:59,677 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:37:59,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:37:59,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:59,712 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:37:59,712 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:37:59,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:59,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:59,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:59,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,737 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:37:59,737 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:37:59,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:37:59,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:37:59,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:37:59,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:59,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:37:59,876 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:37:59,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:59,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:59,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:59,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1330 [2022-12-06 07:37:59,876 INFO L420 AbstractCegarLoop]: === Iteration 1332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:37:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash 629626505, now seen corresponding path program 1 times [2022-12-06 07:37:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:59,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434253933] [2022-12-06 07:37:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:59,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:37:59,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:59,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434253933] [2022-12-06 07:37:59,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434253933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:59,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:59,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:37:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640332696] [2022-12-06 07:37:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:59,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:59,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:37:59,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:59,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:59,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:37:59,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:00,203 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:00,203 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:38:00,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:00,217 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:00,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:00,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:00,217 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:00,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:00,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:00,251 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:00,251 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:00,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:00,251 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:00,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:00,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,276 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:00,276 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:38:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:00,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:00,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:00,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:38:00,417 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:00,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:00,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:00,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:00,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1331 [2022-12-06 07:38:00,417 INFO L420 AbstractCegarLoop]: === Iteration 1333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1922530456, now seen corresponding path program 1 times [2022-12-06 07:38:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:00,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884057687] [2022-12-06 07:38:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:00,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:38:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:00,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884057687] [2022-12-06 07:38:00,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884057687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:00,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:00,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170863667] [2022-12-06 07:38:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:00,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:00,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:00,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:00,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:00,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:00,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:00,758 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:00,758 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 07:38:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:00,771 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:00,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:00,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:00,772 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:00,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:00,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:00,806 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:00,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:00,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:00,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:00,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,830 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:00,831 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:38:00,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:00,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:00,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:00,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:00,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 07:38:00,963 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:00,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:00,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:00,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1332 [2022-12-06 07:38:00,964 INFO L420 AbstractCegarLoop]: === Iteration 1334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -179720121, now seen corresponding path program 1 times [2022-12-06 07:38:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:00,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435316421] [2022-12-06 07:38:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:01,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:38:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:01,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435316421] [2022-12-06 07:38:01,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435316421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:01,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:01,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536411654] [2022-12-06 07:38:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:01,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:01,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:01,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:01,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:01,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:01,314 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:01,314 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:38:01,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:01,327 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:01,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:01,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:01,328 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:01,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:01,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:01,364 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,364 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:01,364 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:01,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:01,364 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:01,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:01,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,389 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:01,389 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:38:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:01,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:01,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:01,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:38:01,537 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:01,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:01,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:01,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1333 [2022-12-06 07:38:01,537 INFO L420 AbstractCegarLoop]: === Iteration 1335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1563090214, now seen corresponding path program 1 times [2022-12-06 07:38:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:01,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929861781] [2022-12-06 07:38:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:01,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:38:01,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:01,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929861781] [2022-12-06 07:38:01,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929861781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:01,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:01,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462231418] [2022-12-06 07:38:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:01,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:01,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:01,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:01,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:01,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:01,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:01,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:01,894 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:01,894 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:38:01,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:01,906 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:01,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:01,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:01,907 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:01,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:01,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:01,937 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:01,938 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:01,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:01,938 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:01,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:01,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,963 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:01,963 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:38:01,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:01,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:01,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:02,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:02,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:38:02,106 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:02,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:02,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:02,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:02,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1334 [2022-12-06 07:38:02,106 INFO L420 AbstractCegarLoop]: === Iteration 1336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash -989066747, now seen corresponding path program 1 times [2022-12-06 07:38:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:02,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585859379] [2022-12-06 07:38:02,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:02,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:38:02,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:02,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585859379] [2022-12-06 07:38:02,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585859379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:02,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:02,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980155492] [2022-12-06 07:38:02,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:02,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:02,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:02,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:02,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:02,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:02,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:02,439 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:02,439 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:38:02,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:02,453 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:02,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:02,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:02,454 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:02,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:02,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:02,488 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:02,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:02,488 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:02,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:02,488 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:02,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:02,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:02,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:02,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:02,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:02,520 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:38:02,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:02,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:02,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:02,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:02,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:38:02,663 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:02,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:02,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:02,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:02,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1335 [2022-12-06 07:38:02,663 INFO L420 AbstractCegarLoop]: === Iteration 1337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 753743588, now seen corresponding path program 1 times [2022-12-06 07:38:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:02,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463516570] [2022-12-06 07:38:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:02,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463516570] [2022-12-06 07:38:02,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463516570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:02,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:02,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700914520] [2022-12-06 07:38:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:02,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:02,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:02,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:02,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:02,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:02,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:03,002 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:03,002 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:03,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:03,017 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:03,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:03,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:03,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:03,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:03,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:03,075 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:03,076 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:03,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:03,076 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:03,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:03,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,102 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:03,102 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:38:03,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:03,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:03,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:03,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:38:03,244 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:03,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:03,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:03,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:03,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1336 [2022-12-06 07:38:03,244 INFO L420 AbstractCegarLoop]: === Iteration 1338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1798413373, now seen corresponding path program 1 times [2022-12-06 07:38:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:03,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396982536] [2022-12-06 07:38:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:03,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:38:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:03,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396982536] [2022-12-06 07:38:03,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396982536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:03,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:03,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:03,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371923804] [2022-12-06 07:38:03,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:03,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:03,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:03,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:03,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:03,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:03,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:03,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:03,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:03,579 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:03,579 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:03,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:03,592 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:03,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:03,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:03,593 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:03,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:03,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:03,628 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:03,628 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:03,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:03,628 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,629 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:03,629 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:03,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,653 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:03,653 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 07:38:03,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:03,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:03,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:03,787 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:03,787 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:38:03,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:03,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:03,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:03,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:03,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1337 [2022-12-06 07:38:03,788 INFO L420 AbstractCegarLoop]: === Iteration 1339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:03,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash -55603038, now seen corresponding path program 1 times [2022-12-06 07:38:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:03,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790950513] [2022-12-06 07:38:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:03,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790950513] [2022-12-06 07:38:03,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790950513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:03,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:03,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848617585] [2022-12-06 07:38:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:03,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:03,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:03,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:03,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:03,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:04,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:04,135 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:04,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:04,148 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:04,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:04,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:04,149 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:04,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:04,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:04,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:04,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:04,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:04,183 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:04,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:04,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,208 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:04,208 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:04,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:04,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:04,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:04,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:38:04,352 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:04,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:04,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:04,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:04,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1338 [2022-12-06 07:38:04,352 INFO L420 AbstractCegarLoop]: === Iteration 1340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:04,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1687207297, now seen corresponding path program 1 times [2022-12-06 07:38:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:04,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445202488] [2022-12-06 07:38:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:04,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:38:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445202488] [2022-12-06 07:38:04,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445202488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:04,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:04,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830158470] [2022-12-06 07:38:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:04,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:04,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:04,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:04,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:04,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:04,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:04,696 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:04,697 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:04,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:04,712 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:04,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:04,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:04,712 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:04,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:04,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:04,753 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:04,753 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:04,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:04,753 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:04,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:04,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,779 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:04,779 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 07:38:04,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:04,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:04,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:04,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:04,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:38:04,921 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:04,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:04,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:04,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:04,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1339 [2022-12-06 07:38:04,921 INFO L420 AbstractCegarLoop]: === Iteration 1341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:04,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -864949664, now seen corresponding path program 1 times [2022-12-06 07:38:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:04,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379579811] [2022-12-06 07:38:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379579811] [2022-12-06 07:38:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379579811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:04,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:04,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922646135] [2022-12-06 07:38:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:04,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:04,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:04,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:04,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:04,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:04,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:05,258 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:05,259 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:38:05,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13513 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:05,272 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:05,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:05,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:05,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:05,273 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:05,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:05,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:05,307 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:05,307 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:05,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:05,307 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:05,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:05,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,332 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:05,332 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:38:05,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:05,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:05,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:05,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:38:05,484 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:05,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:05,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:05,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:05,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1340 [2022-12-06 07:38:05,485 INFO L420 AbstractCegarLoop]: === Iteration 1342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 877860671, now seen corresponding path program 1 times [2022-12-06 07:38:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383143897] [2022-12-06 07:38:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:05,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:38:05,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:05,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383143897] [2022-12-06 07:38:05,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383143897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:05,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:05,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197377060] [2022-12-06 07:38:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:05,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:05,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:05,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:05,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:05,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:05,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:05,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:05,815 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:05,815 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:05,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:05,827 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:05,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:05,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:05,828 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:05,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:05,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:05,860 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:05,861 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:05,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:05,861 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:05,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:05,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,885 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:05,885 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:05,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:05,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:06,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:06,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 07:38:06,014 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:06,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:06,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:06,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:06,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1341 [2022-12-06 07:38:06,014 INFO L420 AbstractCegarLoop]: === Iteration 1343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1674296290, now seen corresponding path program 1 times [2022-12-06 07:38:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:06,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790682299] [2022-12-06 07:38:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:06,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:38:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:06,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790682299] [2022-12-06 07:38:06,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790682299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:06,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:06,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055476720] [2022-12-06 07:38:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:06,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:06,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:06,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:06,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:06,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:06,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:06,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:06,334 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:06,334 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:06,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:06,347 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:06,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:06,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:06,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:06,348 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:06,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:06,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:06,384 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:06,385 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:06,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:06,385 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:06,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:06,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,410 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:06,410 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:06,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:06,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:06,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:06,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:38:06,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:06,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:06,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:06,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:06,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1342 [2022-12-06 07:38:06,557 INFO L420 AbstractCegarLoop]: === Iteration 1344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 68514045, now seen corresponding path program 1 times [2022-12-06 07:38:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:06,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693947468] [2022-12-06 07:38:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:06,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:38:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:06,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693947468] [2022-12-06 07:38:06,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693947468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:06,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:06,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737819715] [2022-12-06 07:38:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:06,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:06,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:06,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:06,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:06,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:06,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:06,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:06,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:06,935 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:06,935 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:38:06,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:06,947 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:06,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:06,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:06,948 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:06,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:06,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:06,978 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:06,978 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:06,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:06,978 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:06,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:06,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:06,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,003 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:07,003 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:38:07,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3010 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:07,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:07,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:07,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 07:38:07,153 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:07,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:07,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:07,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1343 [2022-12-06 07:38:07,153 INFO L420 AbstractCegarLoop]: === Iteration 1345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1811324380, now seen corresponding path program 1 times [2022-12-06 07:38:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:07,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466398450] [2022-12-06 07:38:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:07,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:38:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466398450] [2022-12-06 07:38:07,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466398450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:07,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:07,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:07,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106900778] [2022-12-06 07:38:07,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:07,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:07,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:07,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:07,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:07,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:07,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:07,490 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:07,490 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:07,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:07,508 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:07,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:07,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:07,509 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:07,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:07,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:07,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:07,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:07,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:07,549 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:07,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:07,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,575 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:07,575 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 07:38:07,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:07,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:07,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:07,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:07,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 07:38:07,739 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:07,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:07,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:07,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:07,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1344 [2022-12-06 07:38:07,739 INFO L420 AbstractCegarLoop]: === Iteration 1346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash -740832581, now seen corresponding path program 1 times [2022-12-06 07:38:07,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:07,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801327018] [2022-12-06 07:38:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801327018] [2022-12-06 07:38:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801327018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:07,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:07,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608981981] [2022-12-06 07:38:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:07,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:07,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:07,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:07,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:07,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:07,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:07,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:08,099 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:08,100 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:08,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:08,113 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:08,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:08,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:08,114 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:08,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:08,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:08,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:08,149 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:08,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:08,149 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:08,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:08,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,181 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:08,181 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 07:38:08,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:08,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:08,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:08,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 07:38:08,334 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:08,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:08,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:08,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:08,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1345 [2022-12-06 07:38:08,335 INFO L420 AbstractCegarLoop]: === Iteration 1347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1001977754, now seen corresponding path program 1 times [2022-12-06 07:38:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:08,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471265972] [2022-12-06 07:38:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:08,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:38:08,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:08,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471265972] [2022-12-06 07:38:08,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471265972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:08,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:08,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774611266] [2022-12-06 07:38:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:08,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:08,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:08,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:08,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:08,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:08,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:08,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:08,675 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:08,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:08,688 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:08,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:08,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:08,689 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:08,723 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:08,723 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:08,723 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:08,724 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,724 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:08,724 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:08,724 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,749 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:08,749 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 07:38:08,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:08,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:08,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:08,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:08,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 07:38:08,889 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:08,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:08,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:08,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:08,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1346 [2022-12-06 07:38:08,889 INFO L420 AbstractCegarLoop]: === Iteration 1348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1550179207, now seen corresponding path program 1 times [2022-12-06 07:38:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:08,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975042787] [2022-12-06 07:38:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:08,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:38:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:08,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975042787] [2022-12-06 07:38:08,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975042787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:08,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:08,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974879938] [2022-12-06 07:38:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:08,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:08,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:08,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:08,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:08,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:08,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:09,246 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:09,246 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:38:09,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13547 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:09,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:09,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:09,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:09,262 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:09,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:09,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:09,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:09,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:09,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:09,307 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:09,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:09,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,331 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:09,332 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:38:09,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:09,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:09,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:09,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:38:09,483 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:09,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:09,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:09,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:09,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1347 [2022-12-06 07:38:09,483 INFO L420 AbstractCegarLoop]: === Iteration 1349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash 192631128, now seen corresponding path program 1 times [2022-12-06 07:38:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:09,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176522969] [2022-12-06 07:38:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:09,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:38:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:09,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176522969] [2022-12-06 07:38:09,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176522969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:09,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100345873] [2022-12-06 07:38:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:09,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:09,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:09,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:09,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:09,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:09,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:09,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:09,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:09,826 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 07:38:09,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:09,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:09,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:09,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:09,840 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:09,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:09,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:09,871 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,871 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:09,871 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:09,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:09,871 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:09,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:09,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,896 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:09,896 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:38:09,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:09,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:09,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:10,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:10,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:38:10,039 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:10,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:10,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:10,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:10,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1348 [2022-12-06 07:38:10,039 INFO L420 AbstractCegarLoop]: === Iteration 1350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1935441463, now seen corresponding path program 1 times [2022-12-06 07:38:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:10,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988173358] [2022-12-06 07:38:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:10,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:38:10,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988173358] [2022-12-06 07:38:10,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988173358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:10,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:10,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046115062] [2022-12-06 07:38:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:10,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:10,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:10,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:10,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:10,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:10,368 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:10,368 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:10,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:10,381 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:10,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:10,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:10,382 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:10,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:10,418 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:10,418 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:10,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:10,418 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:10,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:10,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,443 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:10,443 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:10,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:10,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:10,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:10,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:38:10,595 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:10,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:10,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:10,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1349 [2022-12-06 07:38:10,595 INFO L420 AbstractCegarLoop]: === Iteration 1351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash -616715498, now seen corresponding path program 1 times [2022-12-06 07:38:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:10,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499821594] [2022-12-06 07:38:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:10,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:38:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499821594] [2022-12-06 07:38:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499821594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:10,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:10,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49900491] [2022-12-06 07:38:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:10,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:10,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:10,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:10,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:10,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:10,937 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:10,937 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:38:10,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:10,949 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:10,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:10,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:10,950 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:10,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:10,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:10,981 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:10,982 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:10,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:10,982 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:10,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:10,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:10,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,006 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:11,006 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 07:38:11,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:11,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:11,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:11,154 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:38:11,154 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:11,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:11,154 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:11,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1350 [2022-12-06 07:38:11,155 INFO L420 AbstractCegarLoop]: === Iteration 1352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1126094837, now seen corresponding path program 1 times [2022-12-06 07:38:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:11,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463354482] [2022-12-06 07:38:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:11,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:38:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463354482] [2022-12-06 07:38:11,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463354482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:11,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:11,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252513641] [2022-12-06 07:38:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:11,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:11,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:11,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:11,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:11,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:11,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:11,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:11,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:11,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:11,479 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:11,479 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 07:38:11,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:11,491 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:11,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:11,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:11,492 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:11,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:11,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:11,524 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:11,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:11,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:11,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:11,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:11,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,548 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:11,548 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:38:11,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:11,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:11,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:11,692 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:11,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:38:11,692 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:11,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:11,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:11,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:11,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1351 [2022-12-06 07:38:11,693 INFO L420 AbstractCegarLoop]: === Iteration 1353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1426062124, now seen corresponding path program 1 times [2022-12-06 07:38:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:11,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528909063] [2022-12-06 07:38:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:11,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:38:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528909063] [2022-12-06 07:38:11,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528909063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:11,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:11,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434085916] [2022-12-06 07:38:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:11,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:11,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:11,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:11,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:11,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:12,040 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:12,040 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:12,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13539 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:12,050 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:12,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:12,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:12,051 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:12,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:12,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:12,080 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:12,080 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:12,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:12,080 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:12,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:12,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,105 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:12,105 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 07:38:12,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:12,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:12,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:12,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:38:12,238 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:12,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:12,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:12,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:12,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1352 [2022-12-06 07:38:12,238 INFO L420 AbstractCegarLoop]: === Iteration 1354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash 316748211, now seen corresponding path program 1 times [2022-12-06 07:38:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:12,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379308164] [2022-12-06 07:38:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:12,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:12,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:38:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:12,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379308164] [2022-12-06 07:38:12,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379308164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:12,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:12,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046622291] [2022-12-06 07:38:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:12,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:12,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:12,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:12,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:12,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:12,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:12,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:12,595 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:38:12,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:12,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:12,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:12,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:12,609 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:12,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:12,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:12,645 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:12,645 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:12,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:12,645 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:12,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:12,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,670 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:12,670 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:38:12,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:12,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:12,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:12,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:12,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 07:38:12,819 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:12,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:12,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:12,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:12,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1353 [2022-12-06 07:38:12,819 INFO L420 AbstractCegarLoop]: === Iteration 1355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2059558546, now seen corresponding path program 1 times [2022-12-06 07:38:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:12,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944120476] [2022-12-06 07:38:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:12,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:38:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944120476] [2022-12-06 07:38:12,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944120476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:12,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:12,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:12,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531024980] [2022-12-06 07:38:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:12,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:12,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:12,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:12,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:12,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:12,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:13,165 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:13,165 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:38:13,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:13,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:13,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:13,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:13,178 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:13,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:13,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:13,213 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:13,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:13,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:13,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:13,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:13,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,238 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:13,238 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:38:13,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:13,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:13,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:13,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 07:38:13,400 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:13,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:13,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:13,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:13,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1354 [2022-12-06 07:38:13,400 INFO L420 AbstractCegarLoop]: === Iteration 1356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:13,401 INFO L85 PathProgramCache]: Analyzing trace with hash -492598415, now seen corresponding path program 1 times [2022-12-06 07:38:13,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:13,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070945702] [2022-12-06 07:38:13,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:13,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:38:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070945702] [2022-12-06 07:38:13,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070945702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:13,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:13,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:13,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081069264] [2022-12-06 07:38:13,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:13,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:13,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:13,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:13,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:13,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:13,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:13,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:13,749 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 07:38:13,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13541 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:13,762 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:13,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:13,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:13,763 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:13,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:13,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:13,799 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:13,799 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:13,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:13,799 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:13,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:13,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,823 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:13,824 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:38:13,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2957 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:13,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:13,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:13,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:13,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 07:38:13,958 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:13,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:13,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:13,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:13,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1355 [2022-12-06 07:38:13,958 INFO L420 AbstractCegarLoop]: === Iteration 1357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1250211920, now seen corresponding path program 1 times [2022-12-06 07:38:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:13,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875975326] [2022-12-06 07:38:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:14,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:38:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875975326] [2022-12-06 07:38:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875975326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:14,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:14,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130592332] [2022-12-06 07:38:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:14,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:14,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:14,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:14,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:14,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:14,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:14,275 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:14,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:14,288 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:14,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:14,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:14,289 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:14,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:14,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:14,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:14,322 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:14,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:14,322 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:14,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:14,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:14,347 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 07:38:14,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:14,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:14,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:14,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 07:38:14,498 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:14,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:14,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:14,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1356 [2022-12-06 07:38:14,499 INFO L420 AbstractCegarLoop]: === Iteration 1358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:14,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1301945041, now seen corresponding path program 1 times [2022-12-06 07:38:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:14,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433702642] [2022-12-06 07:38:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:14,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433702642] [2022-12-06 07:38:14,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433702642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:14,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961287052] [2022-12-06 07:38:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:14,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:14,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:14,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:14,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:14,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:14,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:14,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:14,832 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:14,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:14,845 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:14,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:14,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:14,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:14,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:14,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:14,880 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:14,880 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:14,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:14,880 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:14,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:14,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,905 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:14,905 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:14,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:14,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:14,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:15,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:15,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:38:15,045 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:15,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:15,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:15,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1357 [2022-12-06 07:38:15,046 INFO L420 AbstractCegarLoop]: === Iteration 1359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 440865294, now seen corresponding path program 1 times [2022-12-06 07:38:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937479768] [2022-12-06 07:38:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38: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:38:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937479768] [2022-12-06 07:38:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937479768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:15,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:15,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225418700] [2022-12-06 07:38:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:15,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:15,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:15,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:15,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:15,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:15,399 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:15,399 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:15,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:15,412 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:15,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:15,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:15,413 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:15,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:15,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:15,447 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:15,447 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:15,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:15,447 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:15,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:15,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,472 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:15,472 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:15,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:15,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:15,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:38:15,617 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:15,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:15,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:15,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1358 [2022-12-06 07:38:15,618 INFO L420 AbstractCegarLoop]: === Iteration 1360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2111291667, now seen corresponding path program 1 times [2022-12-06 07:38:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:15,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929951965] [2022-12-06 07:38:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:15,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:38:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:15,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929951965] [2022-12-06 07:38:15,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929951965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:15,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:15,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254825120] [2022-12-06 07:38:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:15,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:15,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:15,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:15,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:15,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:15,951 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:15,951 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:38:15,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:15,963 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:15,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:15,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:15,963 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:15,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:15,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:15,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:15,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:15,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:15,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:15,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:15,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:15,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,020 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:16,020 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:38:16,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:16,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:16,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:16,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:38:16,164 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:16,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:16,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:16,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1359 [2022-12-06 07:38:16,165 INFO L420 AbstractCegarLoop]: === Iteration 1361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -368481332, now seen corresponding path program 1 times [2022-12-06 07:38:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:16,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230144856] [2022-12-06 07:38:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:16,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:38:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230144856] [2022-12-06 07:38:16,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230144856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:16,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:16,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34662556] [2022-12-06 07:38:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:16,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:16,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:16,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:16,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:16,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:16,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:16,497 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:16,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:16,510 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:16,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:16,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:16,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:16,510 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:16,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:16,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:16,546 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:16,546 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:16,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:16,546 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:16,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:16,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,571 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:16,571 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 07:38:16,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:16,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:16,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:16,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:16,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 07:38:16,715 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:16,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:16,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:16,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1360 [2022-12-06 07:38:16,715 INFO L420 AbstractCegarLoop]: === Iteration 1362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:16,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1374329003, now seen corresponding path program 1 times [2022-12-06 07:38:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:16,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099688155] [2022-12-06 07:38:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:38:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:16,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099688155] [2022-12-06 07:38:16,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099688155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:16,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:16,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724663831] [2022-12-06 07:38:16,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:16,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:16,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:16,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:16,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:16,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:16,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:16,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:17,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:17,037 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:38:17,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13508 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:17,072 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:17,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:17,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:17,072 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:17,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:17,102 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:17,102 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:17,102 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:17,102 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:17,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:17,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,127 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:17,128 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 07:38:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:17,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:17,283 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:17,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 07:38:17,283 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:17,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:17,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1361 [2022-12-06 07:38:17,284 INFO L420 AbstractCegarLoop]: === Iteration 1363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1177827958, now seen corresponding path program 1 times [2022-12-06 07:38:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011644849] [2022-12-06 07:38:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:17,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:38:17,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:17,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011644849] [2022-12-06 07:38:17,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011644849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:17,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:17,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373052857] [2022-12-06 07:38:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:17,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:17,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:17,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:17,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:17,608 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:17,608 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:17,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:17,621 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:17,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:17,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:17,622 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:17,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:17,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:17,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:17,657 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:17,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:17,657 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:17,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:17,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,683 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:17,683 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:17,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:17,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:17,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:17,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:17,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 07:38:17,827 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:17,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:17,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:17,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1362 [2022-12-06 07:38:17,827 INFO L420 AbstractCegarLoop]: === Iteration 1364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 564982377, now seen corresponding path program 1 times [2022-12-06 07:38:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355493226] [2022-12-06 07:38:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:17,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:38:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:17,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355493226] [2022-12-06 07:38:17,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355493226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:17,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:17,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:17,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733682361] [2022-12-06 07:38:17,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:17,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:17,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:17,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:17,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:17,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:17,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:17,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:18,174 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:18,174 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:38:18,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:18,187 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:18,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:18,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:18,187 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:18,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:18,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:18,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:18,222 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:18,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:18,222 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:18,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:18,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,246 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:18,246 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 07:38:18,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:18,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:18,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:18,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 07:38:18,390 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:18,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:18,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:18,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1363 [2022-12-06 07:38:18,395 INFO L420 AbstractCegarLoop]: === Iteration 1365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1987174584, now seen corresponding path program 1 times [2022-12-06 07:38:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:18,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158088807] [2022-12-06 07:38:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:18,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:38:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:18,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158088807] [2022-12-06 07:38:18,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158088807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:18,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:18,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341708655] [2022-12-06 07:38:18,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:18,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:18,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:18,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:18,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:18,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:18,724 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:18,724 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:18,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:18,737 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:18,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:18,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:18,737 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:18,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:18,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:18,770 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:18,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:18,770 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:18,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:18,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,795 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:18,795 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 07:38:18,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:18,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:18,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:18,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:18,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 07:38:18,933 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:18,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:18,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:18,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:18,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1364 [2022-12-06 07:38:18,933 INFO L420 AbstractCegarLoop]: === Iteration 1366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash -244364249, now seen corresponding path program 1 times [2022-12-06 07:38:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:18,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547776092] [2022-12-06 07:38:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:19,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:38:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:19,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547776092] [2022-12-06 07:38:19,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547776092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:19,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:19,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989856292] [2022-12-06 07:38:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:19,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:19,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:19,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:19,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:19,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:19,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:19,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:19,279 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:19,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:19,292 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:19,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:19,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:19,293 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:19,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:19,327 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:19,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:19,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:19,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:19,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:19,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,353 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:19,353 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 07:38:19,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3288/3497 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:19,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:19,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:19,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 07:38:19,507 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:19,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:19,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:19,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:19,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1365 [2022-12-06 07:38:19,508 INFO L420 AbstractCegarLoop]: === Iteration 1367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1498446086, now seen corresponding path program 1 times [2022-12-06 07:38:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:19,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134511782] [2022-12-06 07:38:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:19,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:38:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:19,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134511782] [2022-12-06 07:38:19,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134511782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:19,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:19,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478604247] [2022-12-06 07:38:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:19,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:19,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:19,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:19,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:19,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:19,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:19,841 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 07:38:19,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:19,853 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:19,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:19,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:19,854 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:19,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:19,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:19,887 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:19,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:19,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:19,887 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:19,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:19,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,911 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:19,912 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 07:38:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:19,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:19,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:20,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:20,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:38:20,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:20,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:20,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:20,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:20,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1366 [2022-12-06 07:38:20,052 INFO L420 AbstractCegarLoop]: === Iteration 1368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1053710875, now seen corresponding path program 1 times [2022-12-06 07:38:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:20,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230177844] [2022-12-06 07:38:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:20,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:38:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:20,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230177844] [2022-12-06 07:38:20,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230177844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:20,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:20,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525914774] [2022-12-06 07:38:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:20,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:20,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:20,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:20,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:20,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:20,388 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:20,388 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 07:38:20,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:20,400 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:20,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:20,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:20,401 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:20,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:20,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:20,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:20,434 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:20,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:20,434 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:20,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:20,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,458 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 07:38:20,458 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 07:38:20,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 07:38:20,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:20,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:20,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 07:38:20,598 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:20,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:20,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:20,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:20,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1367 [2022-12-06 07:38:20,598 INFO L420 AbstractCegarLoop]: === Iteration 1369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 689099460, now seen corresponding path program 1 times [2022-12-06 07:38:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:20,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75641727] [2022-12-06 07:38:20,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:20,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:38:20,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:20,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75641727] [2022-12-06 07:38:20,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75641727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:20,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:20,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955978194] [2022-12-06 07:38:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:20,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:20,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:20,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:20,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:20,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:20,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:20,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:20,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:20,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:20,948 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 07:38:20,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:20,959 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:20,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:20,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:20,960 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:20,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:20,991 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:20,992 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:20,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:20,992 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,992 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:20,992 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:20,992 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:20,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,016 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:21,016 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 07:38:21,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3015 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:21,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:21,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:21,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:38:21,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:21,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:21,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:21,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:21,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1368 [2022-12-06 07:38:21,153 INFO L420 AbstractCegarLoop]: === Iteration 1370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:21,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1863057501, now seen corresponding path program 1 times [2022-12-06 07:38:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:21,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227629141] [2022-12-06 07:38:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:21,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:38:21,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:21,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227629141] [2022-12-06 07:38:21,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227629141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:21,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075144519] [2022-12-06 07:38:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:21,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:21,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:21,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:21,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:21,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:21,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:38:21,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 07:38:21,470 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 07:38:21,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 07:38:21,482 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 07:38:21,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:38:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 07:38:21,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 07:38:21,483 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 07:38:21,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 07:38:21,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:38:21,516 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 07:38:21,516 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 07:38:21,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:38:21,517 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:38:21,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:21,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,541 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 07:38:21,542 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 07:38:21,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 07:38:21,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 07:38:21,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 07:38:21,695 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:38:21,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 07:38:21,696 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 07:38:21,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:21,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:38:21,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:38:21,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1369 [2022-12-06 07:38:21,696 INFO L420 AbstractCegarLoop]: === Iteration 1371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:38:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:38:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -120247166, now seen corresponding path program 1 times [2022-12-06 07:38:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:38:21,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323051898] [2022-12-06 07:38:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:38:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:38:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:38:21,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:38:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:38:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323051898] [2022-12-06 07:38:21,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323051898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:38:21,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:38:21,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:38:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87791580] [2022-12-06 07:38:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:38:21,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:38:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:38:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:38:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:38:21,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 07:38:21,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:38:21,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:38:21,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 07:38:21,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 07:38:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:38:21,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:38:21,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1370 [2022-12-06 07:38:21,898 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 1/43 universal loopers) in iteration 1371,while PetriNetUnfolder was constructing finite prefix that currently has 1543 conditions, 265 events (170/264 cut-off events. For 3166/3167 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1154 event pairs, 75 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1507. Up to 187 conditions per place.). [2022-12-06 07:38:21,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:38:21,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:38:21,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 07:38:21,900 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 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] [2022-12-06 07:38:21,902 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:38:21,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:38:21,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:38:21 BasicIcfg [2022-12-06 07:38:21,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:38:21,904 INFO L158 Benchmark]: Toolchain (without parser) took 783114.02ms. Allocated memory was 255.9MB in the beginning and 1.0GB in the end (delta: 784.3MB). Free memory was 233.3MB in the beginning and 458.4MB in the end (delta: -225.1MB). Peak memory consumption was 560.3MB. Max. memory is 8.0GB. [2022-12-06 07:38:21,904 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 232.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:38:21,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.62ms. Allocated memory is still 255.9MB. Free memory was 232.7MB in the beginning and 222.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 07:38:21,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.12ms. Allocated memory is still 255.9MB. Free memory was 222.3MB in the beginning and 220.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:38:21,904 INFO L158 Benchmark]: Boogie Preprocessor took 39.23ms. Allocated memory is still 255.9MB. Free memory was 220.6MB in the beginning and 219.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:38:21,905 INFO L158 Benchmark]: RCFGBuilder took 384.32ms. Allocated memory is still 255.9MB. Free memory was 219.1MB in the beginning and 204.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:38:21,905 INFO L158 Benchmark]: TraceAbstraction took 782492.92ms. Allocated memory was 255.9MB in the beginning and 1.0GB in the end (delta: 784.3MB). Free memory was 204.4MB in the beginning and 458.4MB in the end (delta: -253.9MB). Peak memory consumption was 532.0MB. Max. memory is 8.0GB. [2022-12-06 07:38:21,905 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.12ms. Allocated memory is still 255.9MB. Free memory is still 232.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 154.62ms. Allocated memory is still 255.9MB. Free memory was 232.7MB in the beginning and 222.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.12ms. Allocated memory is still 255.9MB. Free memory was 222.3MB in the beginning and 220.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.23ms. Allocated memory is still 255.9MB. Free memory was 220.6MB in the beginning and 219.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 384.32ms. Allocated memory is still 255.9MB. Free memory was 219.1MB in the beginning and 204.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 782492.92ms. Allocated memory was 255.9MB in the beginning and 1.0GB in the end (delta: 784.3MB). Free memory was 204.4MB in the beginning and 458.4MB in the end (delta: -253.9MB). Peak memory consumption was 532.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 92 PlacesBefore, 29 PlacesAfterwards, 89 TransitionsBefore, 22 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 30 ConcurrentYvCompositions, 4 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 624, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 624, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 624, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 624, unknown conditional: 0, unknown unconditional: 624] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 1001, Positive conditional cache size: 0, Positive unconditional cache size: 1001, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 26 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 192 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, 35 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 33, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 66, independent conditional: 15, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 15, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 6, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 37, independent conditional: 9, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 29, unknown conditional: 6, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 6, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 40 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 10, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 6, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 12, Positive unconditional cache size: 37, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 17, Positive unconditional cache size: 47, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 362 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): 64, Positive cache size: 64, Positive conditional cache size: 17, Positive unconditional cache size: 47, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 6, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 39, independent conditional: 6, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 6, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 32, independent conditional: 4, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 73, Positive conditional cache size: 19, Positive unconditional cache size: 54, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown 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, 63 PlacesBefore, 63 PlacesAfterwards, 49 TransitionsBefore, 50 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 26, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 59, independent conditional: 25, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 25, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 11, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 47, independent conditional: 14, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 96, Positive conditional cache size: 30, Positive unconditional cache size: 66, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 70 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 45, Positive unconditional cache size: 66, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 72 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 52, Positive unconditional cache size: 68, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 426 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): 120, Positive cache size: 120, Positive conditional cache size: 52, Positive unconditional cache size: 68, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 69 PlacesBefore, 68 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 129, Positive conditional cache size: 59, Positive unconditional cache size: 70, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 69 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 452 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: 10, independent unconditional: 0, dependent: 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: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 69, Positive unconditional cache size: 72, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 71 PlacesBefore, 71 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 73, Positive unconditional cache size: 73, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 74 PlacesBefore, 74 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 157, Positive conditional cache size: 82, Positive unconditional cache size: 75, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 480 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): 157, Positive cache size: 157, Positive conditional cache size: 82, Positive unconditional cache size: 75, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 73 PlacesBefore, 73 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 476 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): 157, Positive cache size: 157, Positive conditional cache size: 82, Positive unconditional cache size: 75, Negative cache size: 0, Negative conditional cache size: 0, Negative 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, 80 PlacesBefore, 79 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 162, Positive conditional cache size: 85, Positive unconditional cache size: 77, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 83 PlacesBefore, 83 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 168, Positive conditional cache size: 89, Positive unconditional cache size: 79, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 86 PlacesAfterwards, 65 TransitionsBefore, 66 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 117, Positive unconditional cache size: 83, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 91 PlacesBefore, 91 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 208, Positive conditional cache size: 124, Positive unconditional cache size: 84, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 96 PlacesBefore, 95 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 222, Positive conditional cache size: 137, Positive unconditional cache size: 85, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 97 PlacesBefore, 97 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 235, Positive conditional cache size: 148, Positive unconditional cache size: 87, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 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: 149, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 238, Positive conditional cache size: 150, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 239, Positive conditional cache size: 151, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 152, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 153, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 242, Positive conditional cache size: 154, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 243, Positive conditional cache size: 155, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 244, Positive conditional cache size: 156, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 157, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 246, Positive conditional cache size: 158, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 247, Positive conditional cache size: 159, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 248, Positive conditional cache size: 160, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 161, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 250, Positive conditional cache size: 162, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 251, Positive conditional cache size: 163, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 252, Positive conditional cache size: 164, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 165, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 254, Positive conditional cache size: 166, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 255, Positive conditional cache size: 167, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 168, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 169, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 170, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 259, Positive conditional cache size: 171, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 260, Positive conditional cache size: 172, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 173, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 262, Positive conditional cache size: 174, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 263, Positive conditional cache size: 175, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 264, Positive conditional cache size: 176, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 177, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 266, Positive conditional cache size: 178, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 267, Positive conditional cache size: 179, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 268, Positive conditional cache size: 180, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 181, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 270, Positive conditional cache size: 182, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 271, Positive conditional cache size: 183, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 272, Positive conditional cache size: 184, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 185, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 274, Positive conditional cache size: 186, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 275, Positive conditional cache size: 187, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 188, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 189, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 278, Positive conditional cache size: 190, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 279, Positive conditional cache size: 191, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 280, Positive conditional cache size: 192, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 193, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 282, Positive conditional cache size: 194, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 283, Positive conditional cache size: 195, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 284, Positive conditional cache size: 196, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 197, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 286, Positive conditional cache size: 198, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 287, Positive conditional cache size: 199, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 288, Positive conditional cache size: 200, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 201, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 202, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 291, Positive conditional cache size: 203, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 292, Positive conditional cache size: 204, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 205, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 294, Positive conditional cache size: 206, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 207, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 296, Positive conditional cache size: 208, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 209, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 298, Positive conditional cache size: 210, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 299, Positive conditional cache size: 211, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 212, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 213, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 302, Positive conditional cache size: 214, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 303, Positive conditional cache size: 215, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 216, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 217, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 306, Positive conditional cache size: 218, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 307, Positive conditional cache size: 219, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 308, Positive conditional cache size: 220, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 221, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 310, Positive conditional cache size: 222, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 311, Positive conditional cache size: 223, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 312, Positive conditional cache size: 224, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 225, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 314, Positive conditional cache size: 226, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 315, Positive conditional cache size: 227, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 316, Positive conditional cache size: 228, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 229, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 318, Positive conditional cache size: 230, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 319, Positive conditional cache size: 231, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 232, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 233, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 322, Positive conditional cache size: 234, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 323, Positive conditional cache size: 235, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 324, Positive conditional cache size: 236, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 237, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 238, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 327, Positive conditional cache size: 239, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 328, Positive conditional cache size: 240, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 241, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 330, Positive conditional cache size: 242, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 331, Positive conditional cache size: 243, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 332, Positive conditional cache size: 244, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 245, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 334, Positive conditional cache size: 246, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 335, Positive conditional cache size: 247, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 336, Positive conditional cache size: 248, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 249, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 338, Positive conditional cache size: 250, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 339, Positive conditional cache size: 251, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 252, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 253, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 342, Positive conditional cache size: 254, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 343, Positive conditional cache size: 255, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 344, Positive conditional cache size: 256, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 257, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 346, Positive conditional cache size: 258, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 347, Positive conditional cache size: 259, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 348, Positive conditional cache size: 260, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 261, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 350, Positive conditional cache size: 262, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 351, Positive conditional cache size: 263, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 352, Positive conditional cache size: 264, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 265, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 354, Positive conditional cache size: 266, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 355, Positive conditional cache size: 267, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 356, Positive conditional cache size: 268, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 269, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 358, Positive conditional cache size: 270, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 359, Positive conditional cache size: 271, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 360, Positive conditional cache size: 272, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 273, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 362, Positive conditional cache size: 274, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 363, Positive conditional cache size: 275, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 364, Positive conditional cache size: 276, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 277, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 366, Positive conditional cache size: 278, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 367, Positive conditional cache size: 279, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 368, Positive conditional cache size: 280, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 281, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 370, Positive conditional cache size: 282, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 371, Positive conditional cache size: 283, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 372, Positive conditional cache size: 284, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 285, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 374, Positive conditional cache size: 286, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 375, Positive conditional cache size: 287, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 376, Positive conditional cache size: 288, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 289, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 378, Positive conditional cache size: 290, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 379, Positive conditional cache size: 291, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 380, Positive conditional cache size: 292, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 293, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 382, Positive conditional cache size: 294, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 383, Positive conditional cache size: 295, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 384, Positive conditional cache size: 296, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 297, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 386, Positive conditional cache size: 298, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 387, Positive conditional cache size: 299, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 300, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 301, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 302, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 391, Positive conditional cache size: 303, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 392, Positive conditional cache size: 304, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 305, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 394, Positive conditional cache size: 306, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 395, Positive conditional cache size: 307, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 396, Positive conditional cache size: 308, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 309, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 398, Positive conditional cache size: 310, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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:38:21,933 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, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 399, Positive conditional cache size: 311, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 400, Positive conditional cache size: 312, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 313, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 402, Positive conditional cache size: 314, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 403, Positive conditional cache size: 315, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 404, Positive conditional cache size: 316, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 317, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 406, Positive conditional cache size: 318, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 407, Positive conditional cache size: 319, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 320, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 321, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 410, Positive conditional cache size: 322, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 411, Positive conditional cache size: 323, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 412, Positive conditional cache size: 324, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 325, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 414, Positive conditional cache size: 326, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 415, Positive conditional cache size: 327, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 416, Positive conditional cache size: 328, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 329, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 418, Positive conditional cache size: 330, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 419, Positive conditional cache size: 331, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 332, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 333, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 422, Positive conditional cache size: 334, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 423, Positive conditional cache size: 335, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 424, Positive conditional cache size: 336, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 337, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 426, Positive conditional cache size: 338, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 427, Positive conditional cache size: 339, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 428, Positive conditional cache size: 340, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 341, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 430, Positive conditional cache size: 342, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 431, Positive conditional cache size: 343, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 432, Positive conditional cache size: 344, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 345, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 434, Positive conditional cache size: 346, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 435, Positive conditional cache size: 347, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 436, Positive conditional cache size: 348, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 349, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 438, Positive conditional cache size: 350, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 439, Positive conditional cache size: 351, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 440, Positive cache size: 440, Positive conditional cache size: 352, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 353, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 442, Positive conditional cache size: 354, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 443, Positive conditional cache size: 355, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 444, Positive cache size: 444, Positive conditional cache size: 356, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 357, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 446, Positive conditional cache size: 358, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 447, Positive conditional cache size: 359, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 360, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 361, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 450, Positive conditional cache size: 362, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 451, Positive cache size: 451, Positive conditional cache size: 363, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 452, Positive conditional cache size: 364, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 365, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 454, Positive cache size: 454, Positive conditional cache size: 366, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 455, Positive conditional cache size: 367, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 456, Positive conditional cache size: 368, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 369, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 458, Positive conditional cache size: 370, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 459, Positive conditional cache size: 371, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 372, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 373, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 462, Positive conditional cache size: 374, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 463, Positive conditional cache size: 375, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 464, Positive conditional cache size: 376, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 377, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 466, Positive conditional cache size: 378, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 467, Positive cache size: 467, Positive conditional cache size: 379, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 468, Positive conditional cache size: 380, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 381, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 470, Positive conditional cache size: 382, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 471, Positive conditional cache size: 383, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 472, Positive conditional cache size: 384, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 385, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 474, Positive conditional cache size: 386, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 475, Positive conditional cache size: 387, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 476, Positive conditional cache size: 388, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 389, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 478, Positive conditional cache size: 390, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 479, Positive conditional cache size: 391, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 480, Positive conditional cache size: 392, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 393, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 482, Positive conditional cache size: 394, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 483, Positive conditional cache size: 395, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 484, Positive conditional cache size: 396, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 397, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 486, Positive conditional cache size: 398, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 487, Positive cache size: 487, Positive conditional cache size: 399, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 488, Positive conditional cache size: 400, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 401, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 490, Positive conditional cache size: 402, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 491, Positive conditional cache size: 403, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 492, Positive conditional cache size: 404, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 405, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 494, Positive conditional cache size: 406, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 495, Positive conditional cache size: 407, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 496, Positive conditional cache size: 408, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 409, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 410, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 499, Positive cache size: 499, Positive conditional cache size: 411, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 500, Positive conditional cache size: 412, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 413, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 502, Positive conditional cache size: 414, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 503, Positive conditional cache size: 415, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 504, Positive conditional cache size: 416, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 417, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 506, Positive cache size: 506, Positive conditional cache size: 418, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 507, Positive cache size: 507, Positive conditional cache size: 419, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 508, Positive conditional cache size: 420, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 421, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 510, Positive conditional cache size: 422, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 511, Positive conditional cache size: 423, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 512, Positive conditional cache size: 424, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 425, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 514, Positive conditional cache size: 426, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 515, Positive conditional cache size: 427, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 516, Positive conditional cache size: 428, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 429, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 518, Positive conditional cache size: 430, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 519, Positive conditional cache size: 431, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 520, Positive conditional cache size: 432, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 433, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 522, Positive conditional cache size: 434, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 523, Positive conditional cache size: 435, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 524, Positive conditional cache size: 436, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 437, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 526, Positive conditional cache size: 438, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 527, Positive conditional cache size: 439, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 528, Positive conditional cache size: 440, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 441, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 530, Positive cache size: 530, Positive conditional cache size: 442, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 531, Positive cache size: 531, Positive conditional cache size: 443, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 532, Positive conditional cache size: 444, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 445, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 534, Positive conditional cache size: 446, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 535, Positive cache size: 535, Positive conditional cache size: 447, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 536, Positive conditional cache size: 448, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 449, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 538, Positive cache size: 538, Positive conditional cache size: 450, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 539, Positive conditional cache size: 451, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 540, Positive conditional cache size: 452, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 453, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 542, Positive conditional cache size: 454, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 543, Positive cache size: 543, Positive conditional cache size: 455, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 544, Positive conditional cache size: 456, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 457, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 546, Positive conditional cache size: 458, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 547, Positive cache size: 547, Positive conditional cache size: 459, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 548, Positive conditional cache size: 460, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 461, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 550, Positive conditional cache size: 462, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 551, Positive cache size: 551, Positive conditional cache size: 463, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 552, Positive conditional cache size: 464, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 465, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 466, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 555, Positive cache size: 555, Positive conditional cache size: 467, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 556, Positive conditional cache size: 468, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 469, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 558, Positive cache size: 558, Positive conditional cache size: 470, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 559, Positive conditional cache size: 471, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 472, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 473, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 562, Positive cache size: 562, Positive conditional cache size: 474, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 563, Positive cache size: 563, Positive conditional cache size: 475, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 564, Positive conditional cache size: 476, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 477, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 566, Positive cache size: 566, Positive conditional cache size: 478, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 567, Positive cache size: 567, Positive conditional cache size: 479, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 568, Positive conditional cache size: 480, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 481, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 570, Positive cache size: 570, Positive conditional cache size: 482, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 571, Positive conditional cache size: 483, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 572, Positive cache size: 572, Positive conditional cache size: 484, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 485, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 574, Positive cache size: 574, Positive conditional cache size: 486, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 575, Positive conditional cache size: 487, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 576, Positive conditional cache size: 488, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 489, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 578, Positive cache size: 578, Positive conditional cache size: 490, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 579, Positive cache size: 579, Positive conditional cache size: 491, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 580, Positive conditional cache size: 492, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 493, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 582, Positive cache size: 582, Positive conditional cache size: 494, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 583, Positive conditional cache size: 495, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 584, Positive conditional cache size: 496, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 497, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 586, Positive conditional cache size: 498, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 587, Positive conditional cache size: 499, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 588, Positive cache size: 588, Positive conditional cache size: 500, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 501, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 590, Positive cache size: 590, Positive conditional cache size: 502, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 591, Positive conditional cache size: 503, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 592, Positive cache size: 592, Positive conditional cache size: 504, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 505, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 594, Positive cache size: 594, Positive conditional cache size: 506, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 595, Positive conditional cache size: 507, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 596, Positive conditional cache size: 508, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 509, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 598, Positive conditional cache size: 510, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 599, Positive cache size: 599, Positive conditional cache size: 511, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 600, Positive conditional cache size: 512, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 513, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 602, Positive conditional cache size: 514, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 603, Positive conditional cache size: 515, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 604, Positive conditional cache size: 516, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 517, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 606, Positive cache size: 606, Positive conditional cache size: 518, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 607, Positive conditional cache size: 519, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 608, Positive conditional cache size: 520, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 521, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 610, Positive conditional cache size: 522, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 611, Positive cache size: 611, Positive conditional cache size: 523, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 612, Positive conditional cache size: 524, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 525, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 614, Positive cache size: 614, Positive conditional cache size: 526, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 615, Positive cache size: 615, Positive conditional cache size: 527, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 616, Positive cache size: 616, Positive conditional cache size: 528, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 529, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 618, Positive conditional cache size: 530, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 619, Positive cache size: 619, Positive conditional cache size: 531, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 620, Positive cache size: 620, Positive conditional cache size: 532, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 533, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 622, Positive cache size: 622, Positive conditional cache size: 534, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 623, Positive cache size: 623, Positive conditional cache size: 535, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 624, Positive conditional cache size: 536, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 537, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 626, Positive cache size: 626, Positive conditional cache size: 538, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 627, Positive cache size: 627, Positive conditional cache size: 539, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 628, Positive conditional cache size: 540, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 541, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 630, Positive cache size: 630, Positive conditional cache size: 542, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 631, Positive cache size: 631, Positive conditional cache size: 543, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 632, Positive conditional cache size: 544, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 545, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 634, Positive conditional cache size: 546, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 635, Positive cache size: 635, Positive conditional cache size: 547, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 636, Positive cache size: 636, Positive conditional cache size: 548, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 549, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 638, Positive conditional cache size: 550, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 639, Positive cache size: 639, Positive conditional cache size: 551, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 640, Positive conditional cache size: 552, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 553, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 642, Positive cache size: 642, Positive conditional cache size: 554, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 643, Positive conditional cache size: 555, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 644, Positive cache size: 644, Positive conditional cache size: 556, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 557, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 646, Positive cache size: 646, Positive conditional cache size: 558, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 647, Positive conditional cache size: 559, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 648, Positive conditional cache size: 560, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 561, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 650, Positive conditional cache size: 562, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 651, Positive cache size: 651, Positive conditional cache size: 563, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 652, Positive cache size: 652, Positive conditional cache size: 564, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 565, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 654, Positive cache size: 654, Positive conditional cache size: 566, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 655, Positive cache size: 655, Positive conditional cache size: 567, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 656, Positive conditional cache size: 568, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 569, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 658, Positive conditional cache size: 570, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 659, Positive conditional cache size: 571, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 660, Positive conditional cache size: 572, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 573, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 662, Positive conditional cache size: 574, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 663, Positive cache size: 663, Positive conditional cache size: 575, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 664, Positive cache size: 664, Positive conditional cache size: 576, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 577, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 666, Positive conditional cache size: 578, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 667, Positive conditional cache size: 579, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 668, Positive conditional cache size: 580, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 581, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 670, Positive conditional cache size: 582, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 671, Positive cache size: 671, Positive conditional cache size: 583, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 672, Positive conditional cache size: 584, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 585, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 674, Positive conditional cache size: 586, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 675, Positive cache size: 675, Positive conditional cache size: 587, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 676, Positive cache size: 676, Positive conditional cache size: 588, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 589, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 678, Positive cache size: 678, Positive conditional cache size: 590, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 679, Positive conditional cache size: 591, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 680, Positive conditional cache size: 592, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 593, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 682, Positive cache size: 682, Positive conditional cache size: 594, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 683, Positive conditional cache size: 595, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 684, Positive conditional cache size: 596, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 597, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 686, Positive conditional cache size: 598, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 687, Positive conditional cache size: 599, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 688, Positive conditional cache size: 600, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 601, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 690, Positive conditional cache size: 602, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 691, Positive cache size: 691, Positive conditional cache size: 603, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 692, Positive cache size: 692, Positive conditional cache size: 604, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 605, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 694, Positive cache size: 694, Positive conditional cache size: 606, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 695, Positive cache size: 695, Positive conditional cache size: 607, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 696, Positive cache size: 696, Positive conditional cache size: 608, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 609, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 698, Positive cache size: 698, Positive conditional cache size: 610, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 699, Positive cache size: 699, Positive conditional cache size: 611, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 700, Positive cache size: 700, Positive conditional cache size: 612, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 613, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 702, Positive cache size: 702, Positive conditional cache size: 614, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 703, Positive conditional cache size: 615, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 704, Positive cache size: 704, Positive conditional cache size: 616, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 617, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 706, Positive cache size: 706, Positive conditional cache size: 618, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 707, Positive cache size: 707, Positive conditional cache size: 619, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 708, Positive conditional cache size: 620, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 621, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 710, Positive conditional cache size: 622, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 711, Positive conditional cache size: 623, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 712, Positive conditional cache size: 624, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 625, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 714, Positive cache size: 714, Positive conditional cache size: 626, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 715, Positive cache size: 715, Positive conditional cache size: 627, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 716, Positive conditional cache size: 628, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 629, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 718, Positive cache size: 718, Positive conditional cache size: 630, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 719, Positive conditional cache size: 631, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 720, Positive conditional cache size: 632, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 633, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 722, Positive conditional cache size: 634, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 723, Positive cache size: 723, Positive conditional cache size: 635, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 724, Positive cache size: 724, Positive conditional cache size: 636, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 637, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 726, Positive cache size: 726, Positive conditional cache size: 638, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 727, Positive cache size: 727, Positive conditional cache size: 639, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 728, Positive conditional cache size: 640, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 641, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 730, Positive cache size: 730, Positive conditional cache size: 642, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 731, Positive cache size: 731, Positive conditional cache size: 643, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 732, Positive cache size: 732, Positive conditional cache size: 644, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 645, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 734, Positive conditional cache size: 646, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 735, Positive cache size: 735, Positive conditional cache size: 647, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 736, Positive conditional cache size: 648, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 649, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 738, Positive conditional cache size: 650, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 739, Positive conditional cache size: 651, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 740, Positive conditional cache size: 652, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 653, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 742, Positive cache size: 742, Positive conditional cache size: 654, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 743, Positive cache size: 743, Positive conditional cache size: 655, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 744, Positive cache size: 744, Positive conditional cache size: 656, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 657, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 746, Positive cache size: 746, Positive conditional cache size: 658, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 747, Positive cache size: 747, Positive conditional cache size: 659, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 748, Positive conditional cache size: 660, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 661, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 750, Positive conditional cache size: 662, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 751, Positive conditional cache size: 663, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 752, Positive conditional cache size: 664, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 665, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 754, Positive conditional cache size: 666, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 755, Positive cache size: 755, Positive conditional cache size: 667, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 756, Positive conditional cache size: 668, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 669, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 758, Positive cache size: 758, Positive conditional cache size: 670, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 759, Positive cache size: 759, Positive conditional cache size: 671, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 760, Positive conditional cache size: 672, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 673, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 762, Positive cache size: 762, Positive conditional cache size: 674, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 763, Positive cache size: 763, Positive conditional cache size: 675, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 764, Positive conditional cache size: 676, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 677, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 766, Positive conditional cache size: 678, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 767, Positive cache size: 767, Positive conditional cache size: 679, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 768, Positive conditional cache size: 680, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 681, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 770, Positive conditional cache size: 682, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 771, Positive conditional cache size: 683, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 772, Positive cache size: 772, Positive conditional cache size: 684, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 685, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 774, Positive cache size: 774, Positive conditional cache size: 686, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 775, Positive conditional cache size: 687, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 776, Positive conditional cache size: 688, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 689, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 778, Positive cache size: 778, Positive conditional cache size: 690, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 779, Positive conditional cache size: 691, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 780, Positive conditional cache size: 692, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 693, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 782, Positive cache size: 782, Positive conditional cache size: 694, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 783, Positive cache size: 783, Positive conditional cache size: 695, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 784, Positive conditional cache size: 696, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 697, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 786, Positive conditional cache size: 698, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 787, Positive cache size: 787, Positive conditional cache size: 699, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 788, Positive conditional cache size: 700, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 701, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 790, Positive cache size: 790, Positive conditional cache size: 702, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 791, Positive conditional cache size: 703, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 792, Positive conditional cache size: 704, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 705, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 794, Positive cache size: 794, Positive conditional cache size: 706, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 795, Positive conditional cache size: 707, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 796, Positive cache size: 796, Positive conditional cache size: 708, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 709, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 798, Positive conditional cache size: 710, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 799, Positive cache size: 799, Positive conditional cache size: 711, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 800, Positive cache size: 800, Positive conditional cache size: 712, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 713, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 802, Positive conditional cache size: 714, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 803, Positive conditional cache size: 715, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 804, Positive conditional cache size: 716, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 717, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 806, Positive conditional cache size: 718, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 807, Positive cache size: 807, Positive conditional cache size: 719, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 808, Positive cache size: 808, Positive conditional cache size: 720, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 721, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 810, Positive cache size: 810, Positive conditional cache size: 722, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 811, Positive conditional cache size: 723, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 812, Positive conditional cache size: 724, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 725, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 814, Positive cache size: 814, Positive conditional cache size: 726, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 815, Positive cache size: 815, Positive conditional cache size: 727, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 816, Positive cache size: 816, Positive conditional cache size: 728, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 729, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 818, Positive cache size: 818, Positive conditional cache size: 730, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 819, Positive conditional cache size: 731, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 820, Positive cache size: 820, Positive conditional cache size: 732, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 733, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 822, Positive cache size: 822, Positive conditional cache size: 734, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 823, Positive cache size: 823, Positive conditional cache size: 735, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 824, Positive cache size: 824, Positive conditional cache size: 736, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 737, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 826, Positive cache size: 826, Positive conditional cache size: 738, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 827, Positive cache size: 827, Positive conditional cache size: 739, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 828, Positive cache size: 828, Positive conditional cache size: 740, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 741, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 830, Positive cache size: 830, Positive conditional cache size: 742, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 831, Positive cache size: 831, Positive conditional cache size: 743, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 832, Positive cache size: 832, Positive conditional cache size: 744, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 745, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 834, Positive cache size: 834, Positive conditional cache size: 746, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 835, Positive cache size: 835, Positive conditional cache size: 747, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 836, Positive cache size: 836, Positive conditional cache size: 748, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 749, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 838, Positive conditional cache size: 750, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 839, Positive cache size: 839, Positive conditional cache size: 751, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 840, Positive conditional cache size: 752, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 753, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 842, Positive cache size: 842, Positive conditional cache size: 754, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 843, Positive cache size: 843, Positive conditional cache size: 755, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 844, Positive conditional cache size: 756, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 757, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 846, Positive conditional cache size: 758, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 847, Positive cache size: 847, Positive conditional cache size: 759, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 848, Positive conditional cache size: 760, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 761, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 850, Positive cache size: 850, Positive conditional cache size: 762, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 851, Positive cache size: 851, Positive conditional cache size: 763, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 852, Positive cache size: 852, Positive conditional cache size: 764, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 765, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 854, Positive cache size: 854, Positive conditional cache size: 766, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 855, Positive cache size: 855, Positive conditional cache size: 767, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 856, Positive cache size: 856, Positive conditional cache size: 768, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 769, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 858, Positive cache size: 858, Positive conditional cache size: 770, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 859, Positive conditional cache size: 771, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 860, Positive cache size: 860, Positive conditional cache size: 772, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 773, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 862, Positive cache size: 862, Positive conditional cache size: 774, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 863, Positive cache size: 863, Positive conditional cache size: 775, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 864, Positive cache size: 864, Positive conditional cache size: 776, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 777, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 866, Positive conditional cache size: 778, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 867, Positive cache size: 867, Positive conditional cache size: 779, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 868, Positive cache size: 868, Positive conditional cache size: 780, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 781, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 870, Positive cache size: 870, Positive conditional cache size: 782, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 871, Positive cache size: 871, Positive conditional cache size: 783, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 872, Positive cache size: 872, Positive conditional cache size: 784, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 785, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 874, Positive conditional cache size: 786, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 875, Positive cache size: 875, Positive conditional cache size: 787, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 876, Positive cache size: 876, Positive conditional cache size: 788, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 789, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 878, Positive cache size: 878, Positive conditional cache size: 790, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 879, Positive cache size: 879, Positive conditional cache size: 791, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 880, Positive conditional cache size: 792, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 793, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 882, Positive conditional cache size: 794, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 883, Positive cache size: 883, Positive conditional cache size: 795, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 884, Positive cache size: 884, Positive conditional cache size: 796, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 797, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 886, Positive cache size: 886, Positive conditional cache size: 798, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 887, Positive cache size: 887, Positive conditional cache size: 799, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 888, Positive conditional cache size: 800, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 801, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 890, Positive cache size: 890, Positive conditional cache size: 802, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 891, Positive cache size: 891, Positive conditional cache size: 803, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 892, Positive cache size: 892, Positive conditional cache size: 804, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 805, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 894, Positive conditional cache size: 806, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 895, Positive cache size: 895, Positive conditional cache size: 807, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 896, Positive cache size: 896, Positive conditional cache size: 808, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 809, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 898, Positive cache size: 898, Positive conditional cache size: 810, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 899, Positive conditional cache size: 811, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 900, Positive conditional cache size: 812, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 813, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 902, Positive conditional cache size: 814, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 903, Positive cache size: 903, Positive conditional cache size: 815, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 904, Positive cache size: 904, Positive conditional cache size: 816, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 817, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 906, Positive cache size: 906, Positive conditional cache size: 818, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 907, Positive cache size: 907, Positive conditional cache size: 819, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 908, Positive cache size: 908, Positive conditional cache size: 820, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 821, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 910, Positive conditional cache size: 822, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 911, Positive cache size: 911, Positive conditional cache size: 823, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 912, Positive cache size: 912, Positive conditional cache size: 824, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 825, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 914, Positive conditional cache size: 826, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 915, Positive conditional cache size: 827, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 916, Positive cache size: 916, Positive conditional cache size: 828, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 829, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 918, Positive cache size: 918, Positive conditional cache size: 830, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 919, Positive cache size: 919, Positive conditional cache size: 831, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 920, Positive cache size: 920, Positive conditional cache size: 832, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 833, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 922, Positive cache size: 922, Positive conditional cache size: 834, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 923, Positive cache size: 923, Positive conditional cache size: 835, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 924, Positive cache size: 924, Positive conditional cache size: 836, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 837, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 926, Positive cache size: 926, Positive conditional cache size: 838, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 927, Positive cache size: 927, Positive conditional cache size: 839, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 928, Positive conditional cache size: 840, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 841, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 930, Positive cache size: 930, Positive conditional cache size: 842, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 931, Positive cache size: 931, Positive conditional cache size: 843, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 932, Positive cache size: 932, Positive conditional cache size: 844, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 845, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 934, Positive conditional cache size: 846, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 935, Positive cache size: 935, Positive conditional cache size: 847, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 936, Positive cache size: 936, Positive conditional cache size: 848, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 849, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 938, Positive conditional cache size: 850, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 939, Positive conditional cache size: 851, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 940, Positive cache size: 940, Positive conditional cache size: 852, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 853, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 942, Positive conditional cache size: 854, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 943, Positive cache size: 943, Positive conditional cache size: 855, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 944, Positive conditional cache size: 856, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 857, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 946, Positive cache size: 946, Positive conditional cache size: 858, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 947, Positive cache size: 947, Positive conditional cache size: 859, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 948, Positive cache size: 948, Positive conditional cache size: 860, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 861, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 950, Positive conditional cache size: 862, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 951, Positive cache size: 951, Positive conditional cache size: 863, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 952, Positive cache size: 952, Positive conditional cache size: 864, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 865, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 954, Positive cache size: 954, Positive conditional cache size: 866, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 955, Positive conditional cache size: 867, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 956, Positive conditional cache size: 868, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 869, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 958, Positive cache size: 958, Positive conditional cache size: 870, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 959, Positive cache size: 959, Positive conditional cache size: 871, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 960, Positive cache size: 960, Positive conditional cache size: 872, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 873, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 962, Positive cache size: 962, Positive conditional cache size: 874, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 963, Positive cache size: 963, Positive conditional cache size: 875, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 964, Positive cache size: 964, Positive conditional cache size: 876, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 877, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 966, Positive cache size: 966, Positive conditional cache size: 878, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 967, Positive cache size: 967, Positive conditional cache size: 879, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 968, Positive cache size: 968, Positive conditional cache size: 880, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 881, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 970, Positive cache size: 970, Positive conditional cache size: 882, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 971, Positive cache size: 971, Positive conditional cache size: 883, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 972, Positive cache size: 972, Positive conditional cache size: 884, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 885, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 974, Positive cache size: 974, Positive conditional cache size: 886, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 975, Positive cache size: 975, Positive conditional cache size: 887, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 976, Positive conditional cache size: 888, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 889, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 978, Positive cache size: 978, Positive conditional cache size: 890, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 979, Positive cache size: 979, Positive conditional cache size: 891, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 980, Positive cache size: 980, Positive conditional cache size: 892, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 893, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 982, Positive conditional cache size: 894, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 983, Positive cache size: 983, Positive conditional cache size: 895, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 984, Positive cache size: 984, Positive conditional cache size: 896, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 897, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 986, Positive conditional cache size: 898, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 987, Positive cache size: 987, Positive conditional cache size: 899, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 988, Positive conditional cache size: 900, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 901, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 990, Positive conditional cache size: 902, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 991, Positive cache size: 991, Positive conditional cache size: 903, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 992, Positive cache size: 992, Positive conditional cache size: 904, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 905, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 994, Positive cache size: 994, Positive conditional cache size: 906, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 995, Positive cache size: 995, Positive conditional cache size: 907, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 996, Positive conditional cache size: 908, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 909, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 998, Positive conditional cache size: 910, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 999, Positive cache size: 999, Positive conditional cache size: 911, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 1000, Positive conditional cache size: 912, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 913, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1002, Positive cache size: 1002, Positive conditional cache size: 914, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1003, Positive cache size: 1003, Positive conditional cache size: 915, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1004, Positive cache size: 1004, Positive conditional cache size: 916, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 917, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 1006, Positive conditional cache size: 918, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 1007, Positive conditional cache size: 919, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1008, Positive cache size: 1008, Positive conditional cache size: 920, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 921, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 1010, Positive conditional cache size: 922, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 1011, Positive conditional cache size: 923, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1012, Positive cache size: 1012, Positive conditional cache size: 924, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 925, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1014, Positive cache size: 1014, Positive conditional cache size: 926, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 1015, Positive conditional cache size: 927, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1016, Positive cache size: 1016, Positive conditional cache size: 928, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 929, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1018, Positive cache size: 1018, Positive conditional cache size: 930, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 1019, Positive conditional cache size: 931, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 1020, Positive conditional cache size: 932, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 933, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1022, Positive cache size: 1022, Positive conditional cache size: 934, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1023, Positive cache size: 1023, Positive conditional cache size: 935, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1024, Positive cache size: 1024, Positive conditional cache size: 936, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 937, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1026, Positive cache size: 1026, Positive conditional cache size: 938, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1027, Positive cache size: 1027, Positive conditional cache size: 939, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1028, Positive cache size: 1028, Positive conditional cache size: 940, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 941, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1030, Positive cache size: 1030, Positive conditional cache size: 942, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1031, Positive cache size: 1031, Positive conditional cache size: 943, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1032, Positive cache size: 1032, Positive conditional cache size: 944, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 945, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 1034, Positive conditional cache size: 946, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1035, Positive cache size: 1035, Positive conditional cache size: 947, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1036, Positive cache size: 1036, Positive conditional cache size: 948, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 949, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1038, Positive cache size: 1038, Positive conditional cache size: 950, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1039, Positive cache size: 1039, Positive conditional cache size: 951, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1040, Positive cache size: 1040, Positive conditional cache size: 952, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 953, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 1042, Positive conditional cache size: 954, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1043, Positive cache size: 1043, Positive conditional cache size: 955, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1044, Positive cache size: 1044, Positive conditional cache size: 956, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 957, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1046, Positive cache size: 1046, Positive conditional cache size: 958, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1047, Positive cache size: 1047, Positive conditional cache size: 959, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1048, Positive conditional cache size: 960, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 961, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1050, Positive cache size: 1050, Positive conditional cache size: 962, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1051, Positive cache size: 1051, Positive conditional cache size: 963, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1052, Positive conditional cache size: 964, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 965, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 1054, Positive conditional cache size: 966, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1055, Positive cache size: 1055, Positive conditional cache size: 967, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1056, Positive conditional cache size: 968, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 969, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1058, Positive cache size: 1058, Positive conditional cache size: 970, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1059, Positive cache size: 1059, Positive conditional cache size: 971, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1060, Positive cache size: 1060, Positive conditional cache size: 972, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 973, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1062, Positive cache size: 1062, Positive conditional cache size: 974, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1063, Positive cache size: 1063, Positive conditional cache size: 975, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1064, Positive conditional cache size: 976, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 977, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1066, Positive conditional cache size: 978, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1067, Positive cache size: 1067, Positive conditional cache size: 979, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1068, Positive cache size: 1068, Positive conditional cache size: 980, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 981, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1070, Positive cache size: 1070, Positive conditional cache size: 982, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 1071, Positive conditional cache size: 983, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1072, Positive cache size: 1072, Positive conditional cache size: 984, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 985, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1074, Positive cache size: 1074, Positive conditional cache size: 986, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1075, Positive cache size: 1075, Positive conditional cache size: 987, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1076, Positive conditional cache size: 988, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 989, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1078, Positive conditional cache size: 990, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1079, Positive cache size: 1079, Positive conditional cache size: 991, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 1080, Positive conditional cache size: 992, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 993, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1082, Positive cache size: 1082, Positive conditional cache size: 994, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1083, Positive cache size: 1083, Positive conditional cache size: 995, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1084, Positive cache size: 1084, Positive conditional cache size: 996, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 997, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1086, Positive cache size: 1086, Positive conditional cache size: 998, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1087, Positive cache size: 1087, Positive conditional cache size: 999, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1088, Positive conditional cache size: 1000, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1001, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1090, Positive cache size: 1090, Positive conditional cache size: 1002, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1091, Positive cache size: 1091, Positive conditional cache size: 1003, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1092, Positive cache size: 1092, Positive conditional cache size: 1004, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1005, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1094, Positive cache size: 1094, Positive conditional cache size: 1006, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1095, Positive cache size: 1095, Positive conditional cache size: 1007, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1096, Positive conditional cache size: 1008, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1009, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1098, Positive cache size: 1098, Positive conditional cache size: 1010, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1099, Positive cache size: 1099, Positive conditional cache size: 1011, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1100, Positive cache size: 1100, Positive conditional cache size: 1012, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1013, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1102, Positive cache size: 1102, Positive conditional cache size: 1014, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1103, Positive cache size: 1103, Positive conditional cache size: 1015, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1104, Positive cache size: 1104, Positive conditional cache size: 1016, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1017, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1106, Positive cache size: 1106, Positive conditional cache size: 1018, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1107, Positive cache size: 1107, Positive conditional cache size: 1019, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1108, Positive cache size: 1108, Positive conditional cache size: 1020, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1021, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1110, Positive cache size: 1110, Positive conditional cache size: 1022, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1111, Positive cache size: 1111, Positive conditional cache size: 1023, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 1112, Positive conditional cache size: 1024, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1025, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1114, Positive conditional cache size: 1026, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1115, Positive cache size: 1115, Positive conditional cache size: 1027, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1116, Positive cache size: 1116, Positive conditional cache size: 1028, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1029, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1118, Positive conditional cache size: 1030, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1119, Positive conditional cache size: 1031, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1120, Positive cache size: 1120, Positive conditional cache size: 1032, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1033, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1122, Positive cache size: 1122, Positive conditional cache size: 1034, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1123, Positive cache size: 1123, Positive conditional cache size: 1035, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1124, Positive cache size: 1124, Positive conditional cache size: 1036, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1037, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1126, Positive cache size: 1126, Positive conditional cache size: 1038, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1127, Positive conditional cache size: 1039, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1128, Positive cache size: 1128, Positive conditional cache size: 1040, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1041, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1130, Positive cache size: 1130, Positive conditional cache size: 1042, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1131, Positive cache size: 1131, Positive conditional cache size: 1043, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1132, Positive conditional cache size: 1044, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1045, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1134, Positive cache size: 1134, Positive conditional cache size: 1046, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1135, Positive cache size: 1135, Positive conditional cache size: 1047, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1136, Positive conditional cache size: 1048, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1049, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1138, Positive conditional cache size: 1050, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1139, Positive conditional cache size: 1051, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1140, Positive conditional cache size: 1052, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1053, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1142, Positive cache size: 1142, Positive conditional cache size: 1054, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1143, Positive conditional cache size: 1055, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1144, Positive conditional cache size: 1056, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1057, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1146, Positive cache size: 1146, Positive conditional cache size: 1058, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1147, Positive cache size: 1147, Positive conditional cache size: 1059, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1148, Positive conditional cache size: 1060, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1061, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1150, Positive conditional cache size: 1062, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1151, Positive conditional cache size: 1063, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1152, Positive conditional cache size: 1064, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1065, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1154, Positive conditional cache size: 1066, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1155, Positive cache size: 1155, Positive conditional cache size: 1067, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1156, Positive cache size: 1156, Positive conditional cache size: 1068, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1069, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1158, Positive cache size: 1158, Positive conditional cache size: 1070, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1159, Positive conditional cache size: 1071, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1160, Positive conditional cache size: 1072, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1073, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1162, Positive cache size: 1162, Positive conditional cache size: 1074, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1163, Positive conditional cache size: 1075, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1164, Positive cache size: 1164, Positive conditional cache size: 1076, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1077, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1166, Positive cache size: 1166, Positive conditional cache size: 1078, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1167, Positive cache size: 1167, Positive conditional cache size: 1079, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1168, Positive conditional cache size: 1080, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1081, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1170, Positive cache size: 1170, Positive conditional cache size: 1082, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1171, Positive conditional cache size: 1083, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1172, Positive cache size: 1172, Positive conditional cache size: 1084, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1085, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1174, Positive cache size: 1174, Positive conditional cache size: 1086, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1175, Positive conditional cache size: 1087, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1176, Positive conditional cache size: 1088, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1089, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1178, Positive conditional cache size: 1090, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1179, Positive cache size: 1179, Positive conditional cache size: 1091, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1180, Positive cache size: 1180, Positive conditional cache size: 1092, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1093, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1182, Positive conditional cache size: 1094, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1183, Positive cache size: 1183, Positive conditional cache size: 1095, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1184, Positive cache size: 1184, Positive conditional cache size: 1096, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1097, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1186, Positive conditional cache size: 1098, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1187, Positive conditional cache size: 1099, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1188, Positive cache size: 1188, Positive conditional cache size: 1100, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1101, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1190, Positive conditional cache size: 1102, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1191, Positive conditional cache size: 1103, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1192, Positive conditional cache size: 1104, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1105, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1194, Positive conditional cache size: 1106, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1195, Positive cache size: 1195, Positive conditional cache size: 1107, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1196, Positive conditional cache size: 1108, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1109, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1198, Positive conditional cache size: 1110, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1199, Positive conditional cache size: 1111, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1200, Positive conditional cache size: 1112, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1113, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1202, Positive cache size: 1202, Positive conditional cache size: 1114, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1203, Positive conditional cache size: 1115, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1204, Positive conditional cache size: 1116, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1117, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1206, Positive conditional cache size: 1118, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1207, Positive conditional cache size: 1119, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1208, Positive cache size: 1208, Positive conditional cache size: 1120, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1121, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1210, Positive cache size: 1210, Positive conditional cache size: 1122, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1211, Positive cache size: 1211, Positive conditional cache size: 1123, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1212, Positive conditional cache size: 1124, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1125, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1214, Positive cache size: 1214, Positive conditional cache size: 1126, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1215, Positive cache size: 1215, Positive conditional cache size: 1127, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1216, Positive cache size: 1216, Positive conditional cache size: 1128, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1129, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1218, Positive cache size: 1218, Positive conditional cache size: 1130, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1219, Positive cache size: 1219, Positive conditional cache size: 1131, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1220, Positive conditional cache size: 1132, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1133, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1222, Positive cache size: 1222, Positive conditional cache size: 1134, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1223, Positive cache size: 1223, Positive conditional cache size: 1135, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1224, Positive conditional cache size: 1136, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1137, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1226, Positive conditional cache size: 1138, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1227, Positive conditional cache size: 1139, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1228, Positive cache size: 1228, Positive conditional cache size: 1140, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1141, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1230, Positive cache size: 1230, Positive conditional cache size: 1142, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1231, Positive cache size: 1231, Positive conditional cache size: 1143, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1232, Positive conditional cache size: 1144, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1145, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1234, Positive conditional cache size: 1146, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1235, Positive cache size: 1235, Positive conditional cache size: 1147, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1236, Positive cache size: 1236, Positive conditional cache size: 1148, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1149, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1238, Positive conditional cache size: 1150, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1239, Positive cache size: 1239, Positive conditional cache size: 1151, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1240, Positive conditional cache size: 1152, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1153, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1242, Positive cache size: 1242, Positive conditional cache size: 1154, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1243, Positive cache size: 1243, Positive conditional cache size: 1155, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1244, Positive cache size: 1244, Positive conditional cache size: 1156, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1157, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1246, Positive cache size: 1246, Positive conditional cache size: 1158, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1247, Positive cache size: 1247, Positive conditional cache size: 1159, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1248, Positive conditional cache size: 1160, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1161, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1250, Positive cache size: 1250, Positive conditional cache size: 1162, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1251, Positive cache size: 1251, Positive conditional cache size: 1163, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1252, Positive cache size: 1252, Positive conditional cache size: 1164, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1165, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1254, Positive conditional cache size: 1166, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1255, Positive cache size: 1255, Positive conditional cache size: 1167, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1256, Positive cache size: 1256, Positive conditional cache size: 1168, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1169, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1258, Positive conditional cache size: 1170, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1259, Positive cache size: 1259, Positive conditional cache size: 1171, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1260, Positive cache size: 1260, Positive conditional cache size: 1172, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1173, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1262, Positive conditional cache size: 1174, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1263, Positive cache size: 1263, Positive conditional cache size: 1175, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1264, Positive cache size: 1264, Positive conditional cache size: 1176, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1177, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1266, Positive cache size: 1266, Positive conditional cache size: 1178, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1267, Positive cache size: 1267, Positive conditional cache size: 1179, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1268, Positive cache size: 1268, Positive conditional cache size: 1180, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1181, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1270, Positive cache size: 1270, Positive conditional cache size: 1182, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1271, Positive cache size: 1271, Positive conditional cache size: 1183, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1272, Positive conditional cache size: 1184, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1185, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1274, Positive conditional cache size: 1186, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1275, Positive cache size: 1275, Positive conditional cache size: 1187, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1276, Positive cache size: 1276, Positive conditional cache size: 1188, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1189, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1278, Positive cache size: 1278, Positive conditional cache size: 1190, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1279, Positive cache size: 1279, Positive conditional cache size: 1191, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1280, Positive conditional cache size: 1192, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1193, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1282, Positive cache size: 1282, Positive conditional cache size: 1194, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1283, Positive cache size: 1283, Positive conditional cache size: 1195, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1284, Positive cache size: 1284, Positive conditional cache size: 1196, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1197, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1286, Positive cache size: 1286, Positive conditional cache size: 1198, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1287, Positive cache size: 1287, Positive conditional cache size: 1199, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1288, Positive cache size: 1288, Positive conditional cache size: 1200, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1201, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1290, Positive cache size: 1290, Positive conditional cache size: 1202, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1291, Positive cache size: 1291, Positive conditional cache size: 1203, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1292, Positive cache size: 1292, Positive conditional cache size: 1204, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1205, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1294, Positive conditional cache size: 1206, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1295, Positive conditional cache size: 1207, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1296, Positive conditional cache size: 1208, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1209, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1298, Positive cache size: 1298, Positive conditional cache size: 1210, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1299, Positive conditional cache size: 1211, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1300, Positive cache size: 1300, Positive conditional cache size: 1212, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1213, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1302, Positive cache size: 1302, Positive conditional cache size: 1214, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1303, Positive conditional cache size: 1215, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1304, Positive cache size: 1304, Positive conditional cache size: 1216, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1217, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1306, Positive conditional cache size: 1218, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1307, Positive conditional cache size: 1219, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1308, Positive cache size: 1308, Positive conditional cache size: 1220, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1221, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1310, Positive cache size: 1310, Positive conditional cache size: 1222, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1311, Positive cache size: 1311, Positive conditional cache size: 1223, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1312, Positive conditional cache size: 1224, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1225, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1314, Positive conditional cache size: 1226, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1315, Positive conditional cache size: 1227, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1316, Positive conditional cache size: 1228, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1229, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1318, Positive cache size: 1318, Positive conditional cache size: 1230, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1319, Positive conditional cache size: 1231, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1320, Positive cache size: 1320, Positive conditional cache size: 1232, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1233, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1322, Positive conditional cache size: 1234, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1323, Positive cache size: 1323, Positive conditional cache size: 1235, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1324, Positive conditional cache size: 1236, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1237, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1326, Positive cache size: 1326, Positive conditional cache size: 1238, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1327, Positive cache size: 1327, Positive conditional cache size: 1239, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1328, Positive cache size: 1328, Positive conditional cache size: 1240, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1241, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1330, Positive conditional cache size: 1242, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1331, Positive cache size: 1331, Positive conditional cache size: 1243, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1332, Positive cache size: 1332, Positive conditional cache size: 1244, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1245, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1334, Positive conditional cache size: 1246, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1335, Positive conditional cache size: 1247, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1336, Positive conditional cache size: 1248, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1249, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1338, Positive conditional cache size: 1250, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1339, Positive cache size: 1339, Positive conditional cache size: 1251, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1340, Positive conditional cache size: 1252, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1253, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1342, Positive cache size: 1342, Positive conditional cache size: 1254, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1343, Positive cache size: 1343, Positive conditional cache size: 1255, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1344, Positive cache size: 1344, Positive conditional cache size: 1256, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1257, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1346, Positive cache size: 1346, Positive conditional cache size: 1258, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1347, Positive cache size: 1347, Positive conditional cache size: 1259, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1348, Positive conditional cache size: 1260, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1261, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1350, Positive conditional cache size: 1262, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1351, Positive cache size: 1351, Positive conditional cache size: 1263, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1352, Positive conditional cache size: 1264, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1265, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1354, Positive cache size: 1354, Positive conditional cache size: 1266, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1355, Positive cache size: 1355, Positive conditional cache size: 1267, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1356, Positive cache size: 1356, Positive conditional cache size: 1268, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1269, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1358, Positive conditional cache size: 1270, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1359, Positive cache size: 1359, Positive conditional cache size: 1271, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1360, Positive conditional cache size: 1272, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1273, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1362, Positive cache size: 1362, Positive conditional cache size: 1274, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1363, Positive cache size: 1363, Positive conditional cache size: 1275, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1364, Positive cache size: 1364, Positive conditional cache size: 1276, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1277, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1366, Positive cache size: 1366, Positive conditional cache size: 1278, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1367, Positive conditional cache size: 1279, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1368, Positive cache size: 1368, Positive conditional cache size: 1280, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1281, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1370, Positive cache size: 1370, Positive conditional cache size: 1282, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1371, Positive cache size: 1371, Positive conditional cache size: 1283, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1372, Positive cache size: 1372, Positive conditional cache size: 1284, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1285, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1374, Positive cache size: 1374, Positive conditional cache size: 1286, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1375, Positive cache size: 1375, Positive conditional cache size: 1287, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1376, Positive cache size: 1376, Positive conditional cache size: 1288, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1289, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1378, Positive cache size: 1378, Positive conditional cache size: 1290, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1379, Positive conditional cache size: 1291, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1380, Positive cache size: 1380, Positive conditional cache size: 1292, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1293, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1382, Positive conditional cache size: 1294, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1383, Positive cache size: 1383, Positive conditional cache size: 1295, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1384, Positive cache size: 1384, Positive conditional cache size: 1296, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1297, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1386, Positive cache size: 1386, Positive conditional cache size: 1298, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1387, Positive cache size: 1387, Positive conditional cache size: 1299, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1388, Positive cache size: 1388, Positive conditional cache size: 1300, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1301, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1390, Positive cache size: 1390, Positive conditional cache size: 1302, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1391, Positive cache size: 1391, Positive conditional cache size: 1303, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1392, Positive cache size: 1392, Positive conditional cache size: 1304, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1305, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1394, Positive cache size: 1394, Positive conditional cache size: 1306, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1395, Positive cache size: 1395, Positive conditional cache size: 1307, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1396, Positive cache size: 1396, Positive conditional cache size: 1308, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1309, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1398, Positive cache size: 1398, Positive conditional cache size: 1310, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1399, Positive cache size: 1399, Positive conditional cache size: 1311, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1400, Positive cache size: 1400, Positive conditional cache size: 1312, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1313, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1402, Positive cache size: 1402, Positive conditional cache size: 1314, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1403, Positive conditional cache size: 1315, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1404, Positive cache size: 1404, Positive conditional cache size: 1316, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1317, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1406, Positive cache size: 1406, Positive conditional cache size: 1318, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1407, Positive cache size: 1407, Positive conditional cache size: 1319, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1408, Positive cache size: 1408, Positive conditional cache size: 1320, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1321, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1410, Positive cache size: 1410, Positive conditional cache size: 1322, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1411, Positive cache size: 1411, Positive conditional cache size: 1323, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1412, Positive cache size: 1412, Positive conditional cache size: 1324, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1325, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1414, Positive cache size: 1414, Positive conditional cache size: 1326, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1415, Positive cache size: 1415, Positive conditional cache size: 1327, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1416, Positive conditional cache size: 1328, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1329, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1418, Positive cache size: 1418, Positive conditional cache size: 1330, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1419, Positive conditional cache size: 1331, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1420, Positive conditional cache size: 1332, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1333, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1422, Positive conditional cache size: 1334, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1423, Positive conditional cache size: 1335, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1424, Positive cache size: 1424, Positive conditional cache size: 1336, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1337, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1426, Positive cache size: 1426, Positive conditional cache size: 1338, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1427, Positive cache size: 1427, Positive conditional cache size: 1339, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1428, Positive cache size: 1428, Positive conditional cache size: 1340, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1341, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1430, Positive cache size: 1430, Positive conditional cache size: 1342, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1431, Positive cache size: 1431, Positive conditional cache size: 1343, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1432, Positive conditional cache size: 1344, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1345, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1434, Positive conditional cache size: 1346, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1435, Positive cache size: 1435, Positive conditional cache size: 1347, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1436, Positive cache size: 1436, Positive conditional cache size: 1348, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1349, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1438, Positive cache size: 1438, Positive conditional cache size: 1350, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1439, Positive cache size: 1439, Positive conditional cache size: 1351, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1440, Positive conditional cache size: 1352, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1353, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1442, Positive conditional cache size: 1354, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1443, Positive cache size: 1443, Positive conditional cache size: 1355, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1444, Positive cache size: 1444, Positive conditional cache size: 1356, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1357, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1446, Positive cache size: 1446, Positive conditional cache size: 1358, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1447, Positive cache size: 1447, Positive conditional cache size: 1359, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1448, Positive conditional cache size: 1360, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1361, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1450, Positive cache size: 1450, Positive conditional cache size: 1362, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1451, Positive cache size: 1451, Positive conditional cache size: 1363, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1452, Positive cache size: 1452, Positive conditional cache size: 1364, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1365, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1454, Positive cache size: 1454, Positive conditional cache size: 1366, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1455, Positive cache size: 1455, Positive conditional cache size: 1367, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1456, Positive conditional cache size: 1368, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1369, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1458, Positive conditional cache size: 1370, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1459, Positive conditional cache size: 1371, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1460, Positive cache size: 1460, Positive conditional cache size: 1372, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1373, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1462, Positive cache size: 1462, Positive conditional cache size: 1374, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1463, Positive cache size: 1463, Positive conditional cache size: 1375, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1464, Positive cache size: 1464, Positive conditional cache size: 1376, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1377, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1466, Positive conditional cache size: 1378, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1467, Positive cache size: 1467, Positive conditional cache size: 1379, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1468, Positive cache size: 1468, Positive conditional cache size: 1380, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1381, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1470, Positive conditional cache size: 1382, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1471, Positive cache size: 1471, Positive conditional cache size: 1383, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1472, Positive cache size: 1472, Positive conditional cache size: 1384, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1385, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1474, Positive cache size: 1474, Positive conditional cache size: 1386, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1475, Positive cache size: 1475, Positive conditional cache size: 1387, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1476, Positive cache size: 1476, Positive conditional cache size: 1388, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1389, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1478, Positive cache size: 1478, Positive conditional cache size: 1390, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1479, Positive cache size: 1479, Positive conditional cache size: 1391, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1480, Positive cache size: 1480, Positive conditional cache size: 1392, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1393, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1482, Positive conditional cache size: 1394, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1483, Positive cache size: 1483, Positive conditional cache size: 1395, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1484, Positive cache size: 1484, Positive conditional cache size: 1396, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1397, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1486, Positive cache size: 1486, Positive conditional cache size: 1398, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1487, Positive cache size: 1487, Positive conditional cache size: 1399, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1488, Positive cache size: 1488, Positive conditional cache size: 1400, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1401, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1490, Positive cache size: 1490, Positive conditional cache size: 1402, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1491, Positive cache size: 1491, Positive conditional cache size: 1403, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1492, Positive cache size: 1492, Positive conditional cache size: 1404, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1405, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1494, Positive cache size: 1494, Positive conditional cache size: 1406, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1495, Positive cache size: 1495, Positive conditional cache size: 1407, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1496, Positive cache size: 1496, Positive conditional cache size: 1408, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1409, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1498, Positive cache size: 1498, Positive conditional cache size: 1410, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1499, Positive cache size: 1499, Positive conditional cache size: 1411, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1500, Positive cache size: 1500, Positive conditional cache size: 1412, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1413, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1502, Positive cache size: 1502, Positive conditional cache size: 1414, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1503, Positive cache size: 1503, Positive conditional cache size: 1415, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1504, Positive cache size: 1504, Positive conditional cache size: 1416, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1417, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1506, Positive cache size: 1506, Positive conditional cache size: 1418, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1507, Positive cache size: 1507, Positive conditional cache size: 1419, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1508, Positive conditional cache size: 1420, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1421, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1510, Positive cache size: 1510, Positive conditional cache size: 1422, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1511, Positive cache size: 1511, Positive conditional cache size: 1423, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1512, Positive cache size: 1512, Positive conditional cache size: 1424, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1425, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1514, Positive cache size: 1514, Positive conditional cache size: 1426, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1515, Positive cache size: 1515, Positive conditional cache size: 1427, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1516, Positive cache size: 1516, Positive conditional cache size: 1428, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1429, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1518, Positive cache size: 1518, Positive conditional cache size: 1430, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1519, Positive cache size: 1519, Positive conditional cache size: 1431, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1520, Positive cache size: 1520, Positive conditional cache size: 1432, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1433, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1522, Positive cache size: 1522, Positive conditional cache size: 1434, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1523, Positive cache size: 1523, Positive conditional cache size: 1435, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1524, Positive cache size: 1524, Positive conditional cache size: 1436, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1437, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1526, Positive conditional cache size: 1438, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1527, Positive cache size: 1527, Positive conditional cache size: 1439, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1528, Positive cache size: 1528, Positive conditional cache size: 1440, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1441, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1530, Positive cache size: 1530, Positive conditional cache size: 1442, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1531, Positive cache size: 1531, Positive conditional cache size: 1443, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1532, Positive cache size: 1532, Positive conditional cache size: 1444, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1445, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1534, Positive cache size: 1534, Positive conditional cache size: 1446, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1535, Positive cache size: 1535, Positive conditional cache size: 1447, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1536, Positive cache size: 1536, Positive conditional cache size: 1448, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1449, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1538, Positive cache size: 1538, Positive conditional cache size: 1450, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1539, Positive cache size: 1539, Positive conditional cache size: 1451, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1540, Positive cache size: 1540, Positive conditional cache size: 1452, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1453, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1542, Positive cache size: 1542, Positive conditional cache size: 1454, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1543, Positive cache size: 1543, Positive conditional cache size: 1455, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1544, Positive cache size: 1544, Positive conditional cache size: 1456, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1457, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1546, Positive cache size: 1546, Positive conditional cache size: 1458, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1547, Positive cache size: 1547, Positive conditional cache size: 1459, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 1460, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1461, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1550, Positive cache size: 1550, Positive conditional cache size: 1462, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1551, Positive cache size: 1551, Positive conditional cache size: 1463, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1552, Positive cache size: 1552, Positive conditional cache size: 1464, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1465, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1554, Positive cache size: 1554, Positive conditional cache size: 1466, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1555, Positive cache size: 1555, Positive conditional cache size: 1467, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1556, Positive cache size: 1556, Positive conditional cache size: 1468, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1469, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1558, Positive cache size: 1558, Positive conditional cache size: 1470, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1559, Positive cache size: 1559, Positive conditional cache size: 1471, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1560, Positive cache size: 1560, Positive conditional cache size: 1472, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1473, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1562, Positive cache size: 1562, Positive conditional cache size: 1474, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1563, Positive cache size: 1563, Positive conditional cache size: 1475, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1564, Positive cache size: 1564, Positive conditional cache size: 1476, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1477, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1566, Positive cache size: 1566, Positive conditional cache size: 1478, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1567, Positive cache size: 1567, Positive conditional cache size: 1479, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1568, Positive cache size: 1568, Positive conditional cache size: 1480, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1481, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1570, Positive cache size: 1570, Positive conditional cache size: 1482, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1571, Positive cache size: 1571, Positive conditional cache size: 1483, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1572, Positive conditional cache size: 1484, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1485, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1574, Positive cache size: 1574, Positive conditional cache size: 1486, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1575, Positive cache size: 1575, Positive conditional cache size: 1487, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1576, Positive cache size: 1576, Positive conditional cache size: 1488, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1489, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1578, Positive cache size: 1578, Positive conditional cache size: 1490, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1579, Positive cache size: 1579, Positive conditional cache size: 1491, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1580, Positive cache size: 1580, Positive conditional cache size: 1492, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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: 1493, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1582, Positive cache size: 1582, Positive conditional cache size: 1494, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1583, Positive cache size: 1583, Positive conditional cache size: 1495, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1584, Positive cache size: 1584, Positive conditional cache size: 1496, Positive unconditional cache size: 88, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional 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: 80]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 1/43 universal loopers) in iteration 1371,while PetriNetUnfolder was constructing finite prefix that currently has 1543 conditions, 265 events (170/264 cut-off events. For 3166/3167 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1154 event pairs, 75 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1507. Up to 187 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 1/43 universal loopers) in iteration 1371,while PetriNetUnfolder was constructing finite prefix that currently has 1543 conditions, 265 events (170/264 cut-off events. For 3166/3167 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1154 event pairs, 75 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1507. Up to 187 conditions per place.). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 1/43 universal loopers) in iteration 1371,while PetriNetUnfolder was constructing finite prefix that currently has 1543 conditions, 265 events (170/264 cut-off events. For 3166/3167 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1154 event pairs, 75 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1507. Up to 187 conditions per place.). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 1/43 universal loopers) in iteration 1371,while PetriNetUnfolder was constructing finite prefix that currently has 1543 conditions, 265 events (170/264 cut-off events. For 3166/3167 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1154 event pairs, 75 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1507. Up to 187 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 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: 782.4s, OverallIterations: 1371, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 450.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30448 SdHoareTripleChecker+Valid, 127.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30448 mSDsluCounter, 2801 SdHoareTripleChecker+Invalid, 107.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1407 mSDsCounter, 4120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197731 IncrementalHoareTripleChecker+Invalid, 201851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4120 mSolverCounterUnsat, 1394 mSDtfsCounter, 197731 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8340 GetRequests, 4188 SyntacticMatches, 8 SemanticMatches, 4144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1200occurred in iteration=22, InterpolantAutomatonStates: 5505, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 70.3s InterpolantComputationTime, 22028 NumberOfCodeBlocks, 22028 NumberOfCodeBlocksAsserted, 1375 NumberOfCheckSat, 20705 ConstructedInterpolants, 0 QuantifiedInterpolants, 83786 SizeOfPredicates, 19 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 1377 InterpolantComputations, 1371 PerfectInterpolantSequences, 5/11 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